{"title":"挖掘数据集群之间的负链接","authors":"Rifeng Wang, Gang Chen","doi":"10.1109/ICCPS.2015.7454219","DOIUrl":null,"url":null,"abstract":"Link discovery (LD) is an important task in data mining for identifying interactions between data groups, or relating in society community networks. A new strategy is designed for mining a new kind of link: negative links between data clusters. The efficiency is gained by pruning strong positive relative items. Negative item is computing with correlation coefficient. The number of the negative item correlation is used to identify the negative links between clusters. These negative links are extremely useful in business fraud, medical treatment and incursion detection. Experiments on real datasets illustrate that our approach is efficient and promising.","PeriodicalId":319991,"journal":{"name":"2015 IEEE International Conference on Communication Problem-Solving (ICCP)","volume":"123 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2015-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Mining negative links between data clusters\",\"authors\":\"Rifeng Wang, Gang Chen\",\"doi\":\"10.1109/ICCPS.2015.7454219\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Link discovery (LD) is an important task in data mining for identifying interactions between data groups, or relating in society community networks. A new strategy is designed for mining a new kind of link: negative links between data clusters. The efficiency is gained by pruning strong positive relative items. Negative item is computing with correlation coefficient. The number of the negative item correlation is used to identify the negative links between clusters. These negative links are extremely useful in business fraud, medical treatment and incursion detection. Experiments on real datasets illustrate that our approach is efficient and promising.\",\"PeriodicalId\":319991,\"journal\":{\"name\":\"2015 IEEE International Conference on Communication Problem-Solving (ICCP)\",\"volume\":\"123 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2015-10-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2015 IEEE International Conference on Communication Problem-Solving (ICCP)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICCPS.2015.7454219\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2015 IEEE International Conference on Communication Problem-Solving (ICCP)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICCPS.2015.7454219","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Link discovery (LD) is an important task in data mining for identifying interactions between data groups, or relating in society community networks. A new strategy is designed for mining a new kind of link: negative links between data clusters. The efficiency is gained by pruning strong positive relative items. Negative item is computing with correlation coefficient. The number of the negative item correlation is used to identify the negative links between clusters. These negative links are extremely useful in business fraud, medical treatment and incursion detection. Experiments on real datasets illustrate that our approach is efficient and promising.