Sciweavers

100 search results - page 8 / 20
» Clustering with Soft and Group Constraints
Sort
View
SDM
2008
SIAM
123views Data Mining» more  SDM 2008»
13 years 8 months ago
Constrained Co-clustering of Gene Expression Data
In many applications, the expert interpretation of coclustering is easier than for mono-dimensional clustering. Co-clustering aims at computing a bi-partition that is a collection...
Ruggero G. Pensa, Jean-François Boulicaut
CVPR
2010
IEEE
14 years 3 months ago
Nonparametric Higher-Order Learning for Interactive Segmentation
In this paper, we deal with a generative model for multi-label, interactive segmentation. To estimate the pixel likelihoods for each label, we propose a new higher-order formulatio...
Tae Hoon Kim (Seoul National University), Kyoung M...
KAIS
2007
75views more  KAIS 2007»
13 years 7 months ago
Non-redundant data clustering
Data clustering is a popular approach for automatically finding classes, concepts, or groups of patterns. In practice this discovery process should avoid redundancies with existi...
David Gondek, Thomas Hofmann
ICASSP
2010
IEEE
13 years 7 months ago
Multiplicative update rules for nonnegative matrix factorization with co-occurrence constraints
Nonnegative matrix factorization (NMF) is a widely-used tool for obtaining low-rank approximations of nonnegative data such as digital images, audio signals, textual data, financ...
Steven K. Tjoa, K. J. Ray Liu
FSKD
2005
Springer
95views Fuzzy Logic» more  FSKD 2005»
14 years 28 days ago
The Fuzzy Mega-cluster: Robustifying FCM by Scaling Down Memberships
A new robust clustering scheme based on fuzzy c-means is proposed and the concept of a fuzzy mega-cluster is introduced in this paper. The fuzzy mega-cluster is conceptually simila...
Amit Banerjee, Rajesh N. Davé