Sciweavers

KDD
2006
ACM
132views Data Mining» more  KDD 2006»
14 years 9 months ago
Utility-based anonymization using local recoding
Privacy becomes a more and more serious concern in applications involving microdata. Recently, efficient anonymization has attracted much research work. Most of the previous metho...
Jian Xu, Wei Wang 0009, Jian Pei, Xiaoyuan Wang, B...
KDD
2006
ACM
112views Data Mining» more  KDD 2006»
14 years 9 months ago
K-means clustering versus validation measures: a data distribution perspective
K-means is a widely used partitional clustering method. While there are considerable research efforts to characterize the key features of K-means clustering, further investigation...
Hui Xiong, Junjie Wu, Jian Chen
KDD
2006
ACM
134views Data Mining» more  KDD 2006»
14 years 9 months ago
Identifying bridging rules between conceptual clusters
1 A bridging rule in this paper has its antecedent and action from different conceptual clusters. We first design two algorithms for mining bridging rules between clusters in a dat...
Shichao Zhang, Feng Chen, Xindong Wu, Chengqi Zhan...
KDD
2006
ACM
183views Data Mining» more  KDD 2006»
14 years 9 months ago
Discovering interesting patterns through user's interactive feedback
In this paper, we study the problem of discovering interesting patterns through user's interactive feedback. We assume a set of candidate patterns (i.e., frequent patterns) h...
Dong Xin, Xuehua Shen, Qiaozhu Mei, Jiawei Han
KDD
2006
ACM
172views Data Mining» more  KDD 2006»
14 years 9 months ago
Attack detection in time series for recommender systems
Recent research has identified significant vulnerabilities in recommender systems. Shilling attacks, in which attackers introduce biased ratings in order to influence future recom...
Sheng Zhang, Amit Chakrabarti, James Ford, Fillia ...
KDD
2006
ACM
109views Data Mining» more  KDD 2006»
14 years 9 months ago
Extracting redundancy-aware top-k patterns
Observed in many applications, there is a potential need of extracting a small set of frequent patterns having not only high significance but also low redundancy. The significance...
Dong Xin, Hong Cheng, Xifeng Yan, Jiawei Han
KDD
2006
ACM
160views Data Mining» more  KDD 2006»
14 years 9 months ago
Coherent closed quasi-clique discovery from large dense graph databases
Frequent coherent subgraphscan provide valuable knowledgeabout the underlying internal structure of a graph database, and mining frequently occurring coherent subgraphs from large...
Zhiping Zeng, Jianyong Wang, Lizhu Zhou, George Ka...
KDD
2006
ACM
153views Data Mining» more  KDD 2006»
14 years 9 months ago
Semi-supervised time series classification
The problem of time series classification has attracted great interest in the last decade. However current research assumes the existence of large amounts of labeled training data...
Li Wei, Eamonn J. Keogh
KDD
2006
ACM
130views Data Mining» more  KDD 2006»
14 years 9 months ago
Discovering significant rules
In many applications, association rules will only be interesting if they represent non-trivial correlations between all constituent items. Numerous techniques have been developed ...
Geoffrey I. Webb