Sciweavers

KDD
2004
ACM
136views Data Mining» more  KDD 2004»
14 years 5 months ago
Exploring the community structure of newsgroups
d Abstract] Christian Borgs Jennifer Chayes Mohammad Mahdian Amin Saberi We propose to use the community structure of Usenet for organizing and retrieving the information stored i...
Christian Borgs, Jennifer T. Chayes, Mohammad Mahd...
KDD
2004
ACM
117views Data Mining» more  KDD 2004»
14 years 5 months ago
Systematic data selection to mine concept-drifting data streams
One major problem of existing methods to mine data streams is that it makes ad hoc choices to combine most recent data with some amount of old data to search the new hypothesis. T...
Wei Fan
KDD
2004
ACM
181views Data Mining» more  KDD 2004»
14 years 5 months ago
Column-generation boosting methods for mixture of kernels
We devise a boosting approach to classification and regression based on column generation using a mixture of kernels. Traditional kernel methods construct models based on a single...
Jinbo Bi, Tong Zhang, Kristin P. Bennett
KDD
2004
ACM
156views Data Mining» more  KDD 2004»
14 years 5 months ago
TiVo: making show recommendations using a distributed collaborative filtering architecture
We describe the TiVo television show collaborative recommendation system which has been fielded in over one million TiVo clients for four years. Over this install base, TiVo curre...
Kamal Ali, Wijnand van Stam
KDD
2004
ACM
114views Data Mining» more  KDD 2004»
14 years 5 months ago
Mining reference tables for automatic text segmentation
Automatically segmenting unstructured text strings into structured records is necessary for importing the information contained in legacy sources and text collections into a data ...
Eugene Agichtein, Venkatesh Ganti
KDD
2004
ACM
135views Data Mining» more  KDD 2004»
14 years 5 months ago
On demand classification of data streams
Charu C. Aggarwal, Jiawei Han, Jianyong Wang, Phil...
KDD
2004
ACM
132views Data Mining» more  KDD 2004»
14 years 5 months ago
A probabilistic framework for semi-supervised clustering
Unsupervised clustering can be significantly improved using supervision in the form of pairwise constraints, i.e., pairs of instances labeled as belonging to same or different clu...
Sugato Basu, Mikhail Bilenko, Raymond J. Mooney
KDD
2004
ACM
103views Data Mining» more  KDD 2004»
14 years 5 months ago
An objective evaluation criterion for clustering
We propose and test an objective criterion for evaluation of clustering performance: How well does a clustering algorithm run on unlabeled data aid a classification algorithm? The...
Arindam Banerjee, John Langford
KDD
2004
ACM
112views Data Mining» more  KDD 2004»
14 years 5 months ago
An iterative method for multi-class cost-sensitive learning
Naoki Abe, Bianca Zadrozny, John Langford