Sciweavers

7413 search results - page 1296 / 1483
» Using Specularities for Recognition
Sort
View
KDD
2007
ACM
148views Data Mining» more  KDD 2007»
14 years 8 months ago
Scalable look-ahead linear regression trees
Most decision tree algorithms base their splitting decisions on a piecewise constant model. Often these splitting algorithms are extrapolated to trees with non-constant models at ...
David S. Vogel, Ognian Asparouhov, Tobias Scheffer
KDD
2005
ACM
181views Data Mining» more  KDD 2005»
14 years 8 months ago
Evaluating similarity measures: a large-scale study in the orkut social network
Online information services have grown too large for users to navigate without the help of automated tools such as collaborative filtering, which makes recommendations to users ba...
Ellen Spertus, Mehran Sahami, Orkut Buyukkokten
KDD
2004
ACM
302views Data Mining» more  KDD 2004»
14 years 8 months ago
Redundancy based feature selection for microarray data
In gene expression microarray data analysis, selecting a small number of discriminative genes from thousands of genes is an important problem for accurate classification of diseas...
Lei Yu, Huan Liu
KDD
2003
ACM
124views Data Mining» more  KDD 2003»
14 years 8 months ago
Information-theoretic co-clustering
Two-dimensional contingency or co-occurrence tables arise frequently in important applications such as text, web-log and market-basket data analysis. A basic problem in contingenc...
Inderjit S. Dhillon, Subramanyam Mallela, Dharmend...
KDD
2003
ACM
148views Data Mining» more  KDD 2003»
14 years 8 months ago
Mining data records in Web pages
A large amount of information on the Web is contained in regularly structured objects, which we call data records. Such data records are important because they often present the e...
Bing Liu, Robert L. Grossman, Yanhong Zhai
« Prev « First page 1296 / 1483 Last » Next »