Sciweavers

ICDM
2006
IEEE
123views Data Mining» more  ICDM 2006»
14 years 2 months ago
Cluster Ranking with an Application to Mining Mailbox Networks
Ziv Bar-Yossef, Ido Guy, Ronny Lempel, Yoëlle...
ICDM
2006
IEEE
130views Data Mining» more  ICDM 2006»
14 years 2 months ago
Boosting for Learning Multiple Classes with Imbalanced Class Distribution
Classification of data with imbalanced class distribution has posed a significant drawback of the performance attainable by most standard classifier learning algorithms, which ...
Yanmin Sun, Mohamed S. Kamel, Yang Wang 0007
ICDM
2006
IEEE
131views Data Mining» more  ICDM 2006»
14 years 2 months ago
Dimension Reduction for Supervised Ordering
Ordered lists of objects are widely used as representational forms. Such ordered objects include Web search results and best-seller lists. Techniques for processing such ordinal d...
Toshihiro Kamishima, Shotaro Akaho
ICDM
2006
IEEE
89views Data Mining» more  ICDM 2006»
14 years 2 months ago
On the Lower Bound of Local Optimums in K-Means Algorithm
The k-means algorithm is a popular clustering method used in many different fields of computer science, such as data mining, machine learning and information retrieval. However, ...
Zhenjie Zhang, Bing Tian Dai, Anthony K. H. Tung
ICDM
2006
IEEE
146views Data Mining» more  ICDM 2006»
14 years 2 months ago
Boosting Kernel Models for Regression
This paper proposes a general boosting framework for combining multiple kernel models in the context of both classification and regression problems. Our main approach is built on...
Ping Sun, Xin Yao
ICDM
2006
IEEE
296views Data Mining» more  ICDM 2006»
14 years 2 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
129views Data Mining» more  ICDM 2006»
14 years 2 months ago
Getting the Most Out of Ensemble Selection
We investigate four previously unexplored aspects of ensemble selection, a procedure for building ensembles of classifiers. First we test whether adjusting model predictions to p...
Rich Caruana, Art Munson, Alexandru Niculescu-Mizi...
ICDM
2006
IEEE
119views Data Mining» more  ICDM 2006»
14 years 2 months ago
Direct Marketing When There Are Voluntary Buyers
1 In traditional direct marketing, the implicit assumption is that customers will only purchase the product if they are contacted. In real business environments, however, there ar...
Yi-Ting Lai, Ke Wang, Daymond Ling, Hua Shi, Jason...
ICDM
2006
IEEE
183views Data Mining» more  ICDM 2006»
14 years 2 months ago
Accelerating Newton Optimization for Log-Linear Models through Feature Redundancy
— Log-linear models are widely used for labeling feature vectors and graphical models, typically to estimate robust conditional distributions in presence of a large number of pot...
Arpit Mathur, Soumen Chakrabarti
ICDM
2006
IEEE
225views Data Mining» more  ICDM 2006»
14 years 2 months ago
Adaptive Kernel Principal Component Analysis with Unsupervised Learning of Kernels
Choosing an appropriate kernel is one of the key problems in kernel-based methods. Most existing kernel selection methods require that the class labels of the training examples ar...
Daoqiang Zhang, Zhi-Hua Zhou, Songcan Chen