1254 search results - page 186 / 251 » Making Hard Problems Harder |
KDD
2007
ACM
14 years 9 months ago
2007
ACM
A good distance metric is crucial for many data mining tasks. To learn a metric in the unsupervised setting, most metric learning algorithms project observed data to a lowdimensio...
KDD
2007
ACM
14 years 9 months ago
2007
ACM
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...
KDD
2007
ACM
14 years 9 months ago
2007
ACM
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...
KDD
2007
ACM
14 years 9 months ago
2007
ACM
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...
KDD
2006
ACM
14 years 9 months ago
2006
ACM
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 ...