Sciweavers

149 search results - page 23 / 30
» Unsupervised clustering using hyperclique pattern constraint...
Sort
View
KDD
2003
ACM
124views Data Mining» more  KDD 2003»
14 years 8 months ago
Information-theoretic co-clustering
Two-dimensional contingency or co-occurrence tables arise frequently in important applications such as text, web-log and market-basket data analysis. A basic problem in contingenc...
Inderjit S. Dhillon, Subramanyam Mallela, Dharmend...
KDD
2005
ACM
127views Data Mining» more  KDD 2005»
14 years 1 months ago
Mining closed relational graphs with connectivity constraints
Relational graphs are widely used in modeling large scale networks such as biological networks and social networks. In this kind of graph, connectivity becomes critical in identif...
Xifeng Yan, Xianghong Jasmine Zhou, Jiawei Han
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
ICML
2008
IEEE
14 years 8 months ago
Expectation-maximization for sparse and non-negative PCA
We study the problem of finding the dominant eigenvector of the sample covariance matrix, under additional constraints on the vector: a cardinality constraint limits the number of...
Christian D. Sigg, Joachim M. Buhmann
RECOMB
2010
Springer
14 years 2 months ago
A Novel Abundance-Based Algorithm for Binning Metagenomic Sequences Using l-Tuples
Abstract. Metagenomics is the study of microbial communities sampled directly from their natural environment, without prior culturing. Among the computational tools recently develo...
Yu-Wei Wu, Yuzhen Ye