Journal of KIISE:Computing Practices and Letters (한국정보과학회논문지:컴퓨팅의 실제 및 레터)

Korean Institute of Information Scientists and Engineers (한국정보과학회)
권호 표지

Proximity Measurement between Communication Objects

통신 객체들 간의 친밀도 측정

  • Published : 2009.04.15
Download PDF
⟨ Previous Next ⟩

Abstract

Many countries including the US and ED oblige telecommunication service providers to retain communication logs for a certain amount of time. The retained data are used for the purpose of the investigation, detection, or prosecution of serious crimes, but of huge size. In order to efficiently extract information such as a correlation between criminals and suspects, we must eliminate unnecessary data that occupy a large portion of communication logs. In this paper, we propose how to measure the proximity between communication objects using communication logs. The proximity let the collected data be analyzed efficiently: analyzing the data in the decreasing order of proximities or removing the data with low proximities before analyzing. The experimental results show that there is a correlation between proximities of our proposed measurement and estimation by people.

미국과 유럽 연합 등을 포함한 여러 나라에서 통신 서비스 제공자들에 게 통신 기록들을 일정 기간 보관하도록 의무화하고 있다. 저장된 통신 기록들은 범죄의 수사 및 감시, 기소 등의 목적으로 사용되지만, 그 크기가 매우 크다. 저장된 통신 기록으로부터 범죄자들과 용의자들의 관련성과 같은 정보를 효율적으로 추출하기 위해, 통신 기록의 대부분을 차지하는 불필요한 데이터를 제거해야 한다. 본 논문에서는 통신 기록들을 이용하여 통신 객체들 사이의 친밀도를 측정하는 방법을 제안한다. 주요 감시 대상자들이 주어졌을 때, 측정된 친밀도는 감시 대상자와의 친밀도 크기에 따른 데이터의 선별적인 분석 흑은 낮은 친밀도를 갖는 데이터의 제거 등에 사용될 수 있다. 실험 결과는 제안된 방법에 의해 계산된 친밀도 결과와 사람에 의해 계산된 결과가 서로 상관관계를 갖고 있음을 보여준다.

Keywords

References

  1. Directive 2006/24/EC of the European Parliament and of the Council of 15 March 2006
  2. Brin, S. and Page, L., “The anatomy of a large-scale hypertextual Web search engine,” Computer Networks and ISDN Systems, Vol.30, No.1-7, pp. 107-117, 1998 https://doi.org/10.1016/S0169-7552(98)00110-X
  3. Page, L., Brin, S., Motwani, R. and Winograd. T., "The PageRank citation ranking: Bringing order to the web," Technical report, Stanford Digital Lib-rary Technologies Project, 1998
  4. Kleinberg, J.M., “Authoritative sources in a hyper-linked environment,” Journal of the ACM, Vol.46, No.5, pp. 604-632, 1999 https://doi.org/10.1145/324133.324140
  5. Tomlin, J.A., “A new paradigm for ranking pages on the World Wide Web,” In Proc. of the 12th International World Wide Web Conference, pp 350-355, 2003 https://doi.org/10.1145/775152.775202
  6. Kamvar, S.D., Haveliwala, T.H., Manning, C.D. and Golub, G.H., “Extrapolation methods for acc-elerating PageRank computations.” In Proc. of the 12th International World Wide Web Conference, pp. 261-270, 2003 https://doi.org/10.1145/775152.775190
  7. Gyongyi, Z., Garcia-Molina, H. and Pedersen, J., “Combating web spam with TrustRank,” In Proc. of the 30th International Conference on Very Large Databases, pp. 576-587, 2004
  8. Lempel, R. and Moran, S., “The stochastic approach for link-structure analysis (SALSA) and the TKC effect,” Computer Networks and ISDN Systems, Vol.33, No.1-6, pp. 387-401, 2000 https://doi.org/10.1016/S1389-1286(00)00034-7
  9. Ng, A.Y., Zheng, A.X. and Jordan, M.I., “Stable algorithms for link analysis,” In Proc. of the 24th Annual International ACM SIGIR Conference on Research and Development in Information Retrie-val, pp. 258-266, 2001 https://doi.org/10.1145/383952.384003
  10. Cohn, D. and Chang, H., "Learning to probabilis-tically identify authoritative documents," In Proc. of the 17th International Conference on Machine Learning, pp. 167-174, 2000