상세정보
학술지
An Efficient and Spam-Robust Proximity Measure Between Communication Entities
- 저자
- 전주혁, 송지환, 권정은, 이윤준, 박만호, 김명호
- 발행일
- 201303
- 출처
- Journal of Computer Science and Technology, v.28 no.2, pp.394-400
- ISSN
- 1000-9000
- 출판사
- Springer
- 협약과제
- 10MI2300, WiBro 네트워크 신뢰성 확보 및 위치 인지 기술 개발, 안지환
- 초록
- Electronic communication service providers are obliged to retain communication data for a certain amount of time by their local laws. The retained communication data or the communication logs are used in various applications such as crime detection, viral marketing, analytical study, and so on. Many of these applications rely on effective techniques for analyzing communication logs. In this paper, we focus on measuring the proximity between two communication entities, which is a fundamental and important step toward further analysis of communication logs, and propose a new proximity measure called ESP (Efficient and Spam-Robust Proximity measure). Our proposed measure considers only the (graph-theoretically) shortest paths between two entities and gives small values to those between spam-like entities and others. Thus, it is not only computationally efficient but also spam-robust. By conducting several experiments on real and synthetic datasets, we show that our proposed proximity measure is more accurate, computationally efficient and spam-robust than the existing measures in most cases. © 2013 Springer Science+Business Media New York & Science Press, China.
- KSP 제안 키워드
- Analytical study, Communication services, Computationally Efficient, Crime Detection, Electronic communication, Proximity measure, Service Provider, Synthetic Datasets, Viral marketing, shortest path