Sciweavers

14 search results - page 1 / 3
» Disjunctive Learning with a Soft-Clustering Method
Sort
View
ILP
2003
Springer
13 years 10 months ago
Disjunctive Learning with a Soft-Clustering Method
In the case of concept learning from positive and negative examples, it is rarely possible to find a unique discriminating conjunctive rule; in most cases, a disjunctive descripti...
Guillaume Cleuziou, Lionel Martin, Christel Vrain
ICML
2005
IEEE
14 years 5 months ago
A new Mallows distance based metric for comparing clusterings
Despite of the large number of algorithms developed for clustering, the study on comparing clustering results is limited. In this paper, we propose a measure for comparing cluster...
Ding Zhou, Jia Li, Hongyuan Zha
SDM
2004
SIAM
212views Data Mining» more  SDM 2004»
13 years 6 months ago
Clustering with Bregman Divergences
A wide variety of distortion functions, such as squared Euclidean distance, Mahalanobis distance, Itakura-Saito distance and relative entropy, have been used for clustering. In th...
Arindam Banerjee, Srujana Merugu, Inderjit S. Dhil...
SBIA
2004
Springer
13 years 10 months ago
Learning with Class Skews and Small Disjuncts
One of the main objectives of a Machine Learning – ML – system is to induce a classifier that minimizes classification errors. Two relevant topics in ML are the understanding...
Ronaldo C. Prati, Gustavo E. A. P. A. Batista, Mar...
ECML
2005
Springer
13 years 6 months ago
Clustering and Metaclustering with Nonnegative Matrix Decompositions
Although very widely used in unsupervised data mining, most clustering methods are affected by the instability of the resulting clusters w.r.t. the initialization of the algorithm ...
Liviu Badea