Sciweavers

7053 search results - page 1079 / 1411
» Data Mining of Multi-categorized Data
Sort
View
162
Voted
ICDM
2006
IEEE
93views Data Mining» more  ICDM 2006»
16 years 1 months ago
Comparisons of K-Anonymization and Randomization Schemes under Linking Attacks
Recently K-anonymity has gained popularity as a privacy quantification against linking attacks, in which attackers try to identify a record with values of some identifying attrib...
Zhouxuan Teng, Wenliang Du
240
Voted
ICDM
2006
IEEE
296views Data Mining» more  ICDM 2006»
16 years 1 months ago
Fast Random Walk with Restart and Its Applications
How closely related are two nodes in a graph? How to compute this score quickly, on huge, disk-resident, real graphs? Random walk with restart (RWR) provides a good relevance scor...
Hanghang Tong, Christos Faloutsos, Jia-Yu Pan
ICDM
2006
IEEE
84views Data Mining» more  ICDM 2006»
16 years 1 months ago
Exploratory Under-Sampling for Class-Imbalance Learning
Under-sampling is a class-imbalance learning method which uses only a subset of major class examples and thus is very efficient. The main deficiency is that many major class exa...
Xu-Ying Liu, Jianxin Wu, Zhi-Hua Zhou
ICDM
2006
IEEE
226views Data Mining» more  ICDM 2006»
16 years 1 months ago
Converting Output Scores from Outlier Detection Algorithms into Probability Estimates
Current outlier detection schemes typically output a numeric score representing the degree to which a given observation is an outlier. We argue that converting the scores into wel...
Jing Gao, Pang-Ning Tan
ICDM
2006
IEEE
76views Data Mining» more  ICDM 2006»
16 years 1 months ago
A Probabilistic Ensemble Pruning Algorithm
An ensemble is a group of learners that work together as a committee to solve a problem. However, the existing ensemble training algorithms sometimes generate unnecessary large en...
Huanhuan Chen, Peter Tiño, Xin Yao
« Prev « First page 1079 / 1411 Last » Next »