Sciweavers

12519 search results - page 2274 / 2504
» Approximation Problems Categories
Sort
View
KDD
2007
ACM
181views Data Mining» more  KDD 2007»
16 years 5 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
KDD
2007
ACM
177views Data Mining» more  KDD 2007»
16 years 5 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
155views Data Mining» more  KDD 2006»
16 years 5 months ago
Single-pass online learning: performance, voting schemes and online feature selection
To learn concepts over massive data streams, it is essential to design inference and learning methods that operate in real time with limited memory. Online learning methods such a...
Vitor R. Carvalho, William W. Cohen
KDD
2006
ACM
180views Data Mining» more  KDD 2006»
16 years 5 months ago
Learning the unified kernel machines for classification
Kernel machines have been shown as the state-of-the-art learning techniques for classification. In this paper, we propose a novel general framework of learning the Unified Kernel ...
Steven C. H. Hoi, Michael R. Lyu, Edward Y. Chang
KDD
2006
ACM
118views Data Mining» more  KDD 2006»
16 years 5 months ago
Maximum profit mining and its application in software development
While most software defects (i.e., bugs) are corrected and tested as part of the lengthy software development cycle, enterprise software vendors often have to release software pro...
Charles X. Ling, Victor S. Sheng, Tilmann F. W. Br...
« Prev « First page 2274 / 2504 Last » Next »