

浏览全部资源
扫码关注微信
1. 复旦大学计算机科学技术学院 上海 201203
2. 上海市数据科学重点实验室(复旦大学) 上海 201203
Online First:2015-07,
Published:20 July 2015
移动端阅览
Yun Xiong, Yangyong Zhu. Abnormal Group Mining:Framework and Applications[J]. BIG DATA RESEARCH, 2015, 1(2): 2015020.
Yun Xiong, Yangyong Zhu. Abnormal Group Mining:Framework and Applications[J]. BIG DATA RESEARCH, 2015, 1(2): 2015020. DOI: 10.11959/j.issn.2096-0271.2015020.
特异群组挖掘在证券金融、医疗保险、智能交通、社会网络和生命科学研究等领域具有重要应用价值。特异群组挖掘与聚类、异常挖掘都属于根据数据对象的相似性来划分数据集的数据挖掘任务,但是,特异群组挖掘在问题定义、算法设计和应用效果方面不同于聚类和异常等挖掘任务。为此,系统地阐述了特异群组挖掘任务,分析了特异群组挖掘任务与聚类、异常等任务之间的差异,给出了特异群组挖掘任务的形式化描述及其基础算法,最后,列举了特异群组挖掘的几个重点应用。
Abnormal groups can be found in a wide range of areas.Together with clustering and outlier detection
their goals are all to partition a data set according to data similarity.However
abnormal group mining (AGM) is different in problem definition
algorithm design and applications.To the best of our knowledge
the abnormal group mining problem was investigated systematically.The differences among AGM
clustering and outlier detection were analyzed.The formalized definitions on AGM and a framework algorithm were presented
and several interesting applications were particularized.
朱扬勇 , 熊赟 . 大数据是数据、技术,还是应用 . 大数据 ,2015007
Zhu Y Y , Xiong Y . Defining big data . Big Data Research ,2015007
Mark B . Gartner says solving ‘big data’ challenge involves more than just managing volumes of data . http://www.gartner.com/newsroom/id/1731916 http://www.gartner.com/newsroom/id/1731916 , 2011
Xiong Y , Zhu Y Y . Mining peculiarity groups in day-by-day behavioral datasets . Proceedings of IEEE International Conference on Data Mining (ICDM’09) , Miami,Florida,USA , 2009 : 578 ~ 587
Xiong Y , Zhu Y Y , Yu Philip S , et al . Towards cohesive anomaly mining . Proceedings of the 27th AAAI Conference on Artificial Intelligence (AAAI-13) , Bellevue,Washington,USA , 2013
朱扬勇 , 熊赟 . 数据挖掘新任务:特异群组挖掘 . 中国科技论文在线 , http://www.paper.edu.cn/releasepaper/content/201111-463 http://www.paper.edu.cn/releasepaper/content/201111-463 , 2011
Zhu Y Y , Xiong Y . Peculiarity group mining:a new task in data mining . Science Paper Online , http://www.paper.edu.cn/releasepaper/content/201111-463 http://www.paper.edu.cn/releasepaper/content/201111-463 , 2011
Jain A K . Data clustering:50 years beyond k-means . Pattern Recognition Letters , 2010 , 31 ( 8 ): 651 ~ 666
Tan P N , Steinbach M , Kumar V . Introduction to Data Mining . Boston:Addison-Wesley , 2006
Hawkins D . Identification of Outliers . London:Chapman and Hall , 1980 : 2 ~ 26
Chandola V , Banerjee A , Kumar V . Anomaly detection:a survey . ACM Computing Surveys , 2009 , 41 ( 3 ): 1 ~ 58
Papadimitriou S , Kitagawa H , Gibbons P B . Loci:fast outlier detection using the local correlation integral . Proceedings of the 19th International Conference on DataEngineering , Bangalore,India , 2003 , 315 ~ 327
Liu F T , Ting K M , Zhou Z H . On detecting clustered anomalies using SCiForest . Proceedings of ECML/PKDD , Barcelona,Spain , 2010 : 274 ~ 290
Dettling M , Buhlmann P . Supervised clustering of genes . Genome Biology , 2002 , 3 ( 12 ): 129 ~ 137
Ester M , Kriegel H P , Sander J . A density-based algorithm for discovering clusters in large spatial databases with noise . Proceedings of the 4th International Conference on Knowledge Discovery and Data Mining , Portland,USA , 1996 : 226 ~ 231
Bohm C , Plant C , Shao J . Clustering by synchronization . Proceedings of the 16th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining , Washington,USA , 2010 : 583 ~ 592
Jiang D X , Pei J , Zhang A D . A general approach to mining quality pattern-based clusters from microarray data . Proceedings of DASFAA , Beijing,China , 2005 : 188 ~ 200
Gupta G , Ghosh J . Bregman bubble clustering:a robust,scalable framework for locating multiple,dense regions in data . Proceedings of the 6th International Conference on Data Mining , Hong Kong,China , 2008 : 232 ~ 243
Corral A , Manolopoulos Y , Theodoridis Y . Algorithms for processing k-closest-pair queries in spatial databases . Data & Knowledge Engineering Journal , 2004 ( 49 ): 67 ~ 104
Tao Y F , Yi K , Sheng C , et al . Efficient and accurate nearest neighbor and closest pair search in high-dimensional spase . ACM Transactions on Database Systems , 2010 , 35 ( 3 ): 1 ~ 46
Xiong Y , Zhu Y Y , Yu Philip S . Top-k similarity join in heterogeneous information networks . IEEE Transactions on Knowledge & Data Engineering , 2015 , 27 ( 6 ): 1710 ~ 1723
Cheng J , Ke Y P , Fu A W . Finding maximal cliques in massive networks . IACM Transactions on Database Systems , 2011 , 36 ( 4 ): 1 ~ 34
Tomita E , Tanaka A , Takahashi H . The worst-case time complexity for generating all maximal cliques and computational experiments . Theoretical Computer Science , 2006 , 363 ( 1 ): 28 ~ 42
赵迪 . 原博时基金经理马乐“老鼠仓”深度调查 . 股市动态分析 , 2013
Zhao D . The in-depth investigation of Ma Le “rat trading” at bosera select equity investment fund . Journal of Dynamic Analysis in Stock Market , 2013
Leskovec J , Lang K J , Mahoney M W . Empirical comparison of algorithms for network community detection . Proceedings of the 19th International World Wide Web Conference , Raleigh,North Carolina,USA , 2010 : 631 ~ 640
Feng J , Wang J , Li G . Trie-join:a trie-based method for efficient string similarity joins . The VLDB Journal , 2012 , 21 ( 4 ): 437 ~ 461
Zheng G Y , Tu K , Yang Q . ITFP:an integrated platform of mammalian transcription factors . Bioinformatics , 2008 , 24 ( 20 ): 2416 ~ 2417
Hubert L , Arabie P . Comparing partitions . Journal of Classification , 1985 , 2 ( 1 ): 193 ~ 218
0
Views
875
下载量
0
CSCD
Publicity Resources
Related Articles
Related Author
Related Institution
京公网安备11010802024621