Sciweavers

3641 search results - page 428 / 729
» On Computability of Pattern Recognition Problems
Sort
View
120
Voted
KDD
2003
ACM
124views Data Mining» more  KDD 2003»
16 years 5 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...
IRI
2008
IEEE
15 years 11 months ago
Robust integration of multiple information sources by view completion
There are many applications where multiple data sources, each with its own features, are integrated in order to perform an inference task in an optimal way. Researchers have shown...
Shankara B. Subramanya, Baoxin Li, Huan Liu
SIGIR
2006
ACM
15 years 10 months ago
Feature diversity in cluster ensembles for robust document clustering
The performance of document clustering systems depends on employing optimal text representations, which are not only difficult to determine beforehand, but also may vary from one ...
Xavier Sevillano, Germán Cobo, Francesc Al&...
130
Voted
RSFDGRC
2005
Springer
190views Data Mining» more  RSFDGRC 2005»
15 years 10 months ago
Finding Rough Set Reducts with SAT
Abstract. Feature selection refers to the problem of selecting those input features that are most predictive of a given outcome; a problem encountered in many areas such as machine...
Richard Jensen, Qiang Shen, Andrew Tuson
EWCBR
1998
Springer
15 years 8 months ago
Categorizing Case-Base Maintenance: Dimensions and Directions
Abstract. Experience with the growing number of large-scale CBR systems has led to increasing recognition of the importance of case-base maintenance. Multiple researchers have addr...
David B. Leake, David C. Wilson