完整後設資料紀錄
DC 欄位語言
dc.contributor.authorYing, Josh Jia-Chingen_US
dc.contributor.authorZhang, Jien_US
dc.contributor.authorHuang, Che-Weien_US
dc.contributor.authorChen, Kuan-Taen_US
dc.contributor.authorTseng, Vincent S.en_US
dc.date.accessioned2019-04-02T06:00:29Z-
dc.date.available2019-04-02T06:00:29Z-
dc.date.issued2018-10-01en_US
dc.identifier.issn1556-4681en_US
dc.identifier.urihttp://dx.doi.org/10.1145/3234943en_US
dc.identifier.urihttp://hdl.handle.net/11536/148832-
dc.description.abstractIn recent years, telecommunication fraud has become more rampant internationally with the development of modern technology and global communication. Because of rapid growth in the volume of call logs, the task of fraudulent phone call detection is confronted with big data issues in real-world implementations. Although our previous work, FrauDetector, addressed this problem and achieved some promising results, it can be further enhanced because it focuses only on fraud detection accuracy, whereas the efficiency and scalability are not top priorities. Other known approaches for fraudulent call number detection suffer from long training times or cannot accurately detect fraudulent phone calls in real time. However, the learning process of FrauDetector is too time-consuming to support real-world application. Although we have attempted to accelerate the the learning process of FrauDetector by parallelization, the parallelized learning process, namely PFrauDetector, still cannot afford the computing cost. In this article, we propose a highly efficient incremental graph-mining-based fraudulent phone call detection approach, namely FrauDetectoe , which can automatically label fraudulent phone numbers with a "fraud" tag a crucial prerequisite for distinguishing fraudulent phone call numbers from nonfraudulent ones. FratiDetectoe initially generates smaller, more manageable subnetworks from original graph and performs a parallelized weighted HITS algorithm for a significant speed increase in the graph learning module. It adopts a novel aggregation approach to generate a trust (or experience) value for each phone number (or user) based on their respective local values. After the initial procedure, we can incrementally update the trust (or experience) value for each phone number (or user) while a new fraud phone number is identified. An efficient fraud-centric hash structure is constructed to support fast real-time detection of fraudulent phone numbers in the detection module. We conduct a comprehensive experimental study based on real datasets collected through an antifraud mobile application called Whoscall. The results demonstrate a significantly improved efficiency of our approach compared with FrauDetector as well as superior performance against other major classifier-based methods.en_US
dc.language.isoen_USen_US
dc.subjectTelecommunication frauden_US
dc.subjecttrust value miningen_US
dc.subjectfraudulent phone call detectionen_US
dc.subjectincremental learningen_US
dc.subjectparallelized weighted HITS algorithmen_US
dc.titleFrauDetector(+): An Incremental Graph-Mining Approach for Efficient Fraudulent Phone Call Detectionen_US
dc.typeArticleen_US
dc.identifier.doi10.1145/3234943en_US
dc.identifier.journalACM TRANSACTIONS ON KNOWLEDGE DISCOVERY FROM DATAen_US
dc.citation.volume12en_US
dc.contributor.department資訊工程學系zh_TW
dc.contributor.departmentDepartment of Computer Scienceen_US
dc.identifier.wosnumberWOS:000458013300006en_US
dc.citation.woscount0en_US
顯示於類別:期刊論文