Sciweavers

7 search results - page 1 / 2
» Combining partitions by probabilistic label aggregation
Sort
View
KDD
2005
ACM
177views Data Mining» more  KDD 2005»
13 years 9 months ago
Combining partitions by probabilistic label aggregation
Data clustering represents an important tool in exploratory data analysis. The lack of objective criteria render model selection as well as the identification of robust solutions...
Tilman Lange, Joachim M. Buhmann
INFFUS
2008
97views more  INFFUS 2008»
13 years 4 months ago
Using classifier ensembles to label spatially disjoint data
act 11 We describe an ensemble approach to learning from arbitrarily partitioned data. The partitioning comes from the distributed process12 ing requirements of a large scale simul...
Larry Shoemaker, Robert E. Banfield, Lawrence O. H...
MCS
2004
Springer
13 years 9 months ago
A Probabilistic Model Using Information Theoretic Measures for Cluster Ensembles
Abstract. This paper presents a probabilistic model for combining cluster ensembles utilizing information theoretic measures. Starting from a co-association matrix which summarizes...
Hanan Ayad, Otman A. Basir, Mohamed Kamel
IDEAS
2000
IEEE
96views Database» more  IDEAS 2000»
13 years 8 months ago
A Cost Function for Uniformly Partitioned UB-Trees
Most operations of the relational algebra or SQL - like projection with duplicate elimination, join, ordering, group by and aggregations - are efficiently processed using a sorted...
Volker Markl, Rudolf Bayer
KDD
2004
ACM
132views Data Mining» more  KDD 2004»
14 years 4 months ago
A probabilistic framework for semi-supervised clustering
Unsupervised clustering can be significantly improved using supervision in the form of pairwise constraints, i.e., pairs of instances labeled as belonging to same or different clu...
Sugato Basu, Mikhail Bilenko, Raymond J. Mooney