Sciweavers

KDD
2006
ACM
166views Data Mining» more  KDD 2006»
16 years 7 months ago
Anonymizing sequential releases
An organization makes a new release as new information become available, releases a tailored view for each data request, releases sensitive information and identifying information...
Ke Wang, Benjamin C. M. Fung
KDD
2006
ACM
155views Data Mining» more  KDD 2006»
16 years 7 months ago
Camouflaged fraud detection in domains with complex relationships
We describe a data mining system to detect frauds that are camouflaged to look like normal activities in domains with high number of known relationships. Examples include accounti...
Sankar Virdhagriswaran, Gordon Dakin
KDD
2006
ACM
161views Data Mining» more  KDD 2006»
16 years 7 months ago
Efficient kernel feature extraction for massive data sets
Ivor W. Tsang, András Kocsor, James T. Kwok
129
Voted
KDD
2006
ACM
153views Data Mining» more  KDD 2006»
16 years 7 months ago
Center-piece subgraphs: problem definition and fast solutions
Hanghang Tong, Christos Faloutsos
KDD
2006
ACM
142views Data Mining» more  KDD 2006»
16 years 7 months ago
Mining distance-based outliers from large databases in any metric space
Let R be a set of objects. An object o R is an outlier, if there exist less than k objects in R whose distances to o are at most r. The values of k, r, and the distance metric ar...
Yufei Tao, Xiaokui Xiao, Shuigeng Zhou
KDD
2006
ACM
143views Data Mining» more  KDD 2006»
16 years 7 months ago
Mining long-term search history to improve search accuracy
Long-term search history contains rich information about a user's search preferences. In this paper, we study statistical language modeling based methods to mine contextual i...
Bin Tan, Xuehua Shen, ChengXiang Zhai
KDD
2006
ACM
157views Data Mining» more  KDD 2006»
16 years 7 months ago
Using structure indices for efficient approximation of network properties
Statistics on networks have become vital to the study of relational data drawn from areas such as bibliometrics, fraud detection, bioinformatics, and the Internet. Calculating man...
Matthew J. Rattigan, Marc Maier, David Jensen
KDD
2006
ACM
149views Data Mining» more  KDD 2006»
16 years 7 months ago
Regularized discriminant analysis for high dimensional, low sample size data
Linear and Quadratic Discriminant Analysis have been used widely in many areas of data mining, machine learning, and bioinformatics. Friedman proposed a compromise between Linear ...
Jieping Ye, Tie Wang
KDD
2006
ACM
213views Data Mining» more  KDD 2006»
16 years 7 months ago
Learning sparse metrics via linear programming
Calculation of object similarity, for example through a distance function, is a common part of data mining and machine learning algorithms. This calculation is crucial for efficie...
Glenn Fung, Rómer Rosales
KDD
2006
ACM
134views Data Mining» more  KDD 2006»
16 years 7 months ago
Is there a grand challenge or X-prize for data mining?
This panel will discuss possible exciting and motivating Grand Challenge problems for Data Mining, focusing on bioinformatics, multimedia mining, link mining, text mining, and web...
Gregory Piatetsky-Shapiro, Robert Grossman, Chaban...