Sciweavers

14158 search results - page 2589 / 2832
» Generalized switch-setting problems
Sort
View
KDD
2007
ACM
182views Data Mining» more  KDD 2007»
16 years 4 months ago
Cleaning disguised missing data: a heuristic approach
In some applications such as filling in a customer information form on the web, some missing values may not be explicitly represented as such, but instead appear as potentially va...
Ming Hua, Jian Pei
KDD
2007
ACM
148views Data Mining» more  KDD 2007»
16 years 4 months ago
Detecting research topics via the correlation between graphs and texts
In this paper we address the problem of detecting topics in large-scale linked document collections. Recently, topic detection has become a very active area of research due to its...
Yookyung Jo, Carl Lagoze, C. Lee Giles
KDD
2007
ACM
181views Data Mining» more  KDD 2007»
16 years 4 months ago
BoostCluster: boosting clustering by pairwise constraints
Data clustering is an important task in many disciplines. A large number of studies have attempted to improve clustering by using the side information that is often encoded as pai...
Yi Liu, Rong Jin, Anil K. Jain
149
Voted
KDD
2007
ACM
177views Data Mining» more  KDD 2007»
16 years 4 months ago
Mining optimal decision trees from itemset lattices
We present DL8, an exact algorithm for finding a decision tree that optimizes a ranking function under size, depth, accuracy and leaf constraints. Because the discovery of optimal...
Élisa Fromont, Siegfried Nijssen
KDD
2006
ACM
134views Data Mining» more  KDD 2006»
16 years 4 months ago
Learning to rank networked entities
Several algorithms have been proposed to learn to rank entities modeled as feature vectors, based on relevance feedback. However, these algorithms do not model network connections...
Alekh Agarwal, Soumen Chakrabarti, Sunny Aggarwal
« Prev « First page 2589 / 2832 Last » Next »