Sciweavers

15 search results - page 2 / 3
» An Efficient Algorithm for Mining Coherent Patterns from Het...
Sort
View
KDD
2009
ACM
229views Data Mining» more  KDD 2009»
14 years 6 months ago
An association analysis approach to biclustering
The discovery of biclusters, which denote groups of items that show coherent values across a subset of all the transactions in a data set, is an important type of analysis perform...
Gaurav Pandey, Gowtham Atluri, Michael Steinbach, ...
ICDE
2006
IEEE
222views Database» more  ICDE 2006»
14 years 7 months ago
CLAN: An Algorithm for Mining Closed Cliques from Large Dense Graph Databases
Most previously proposed frequent graph mining algorithms are intended to find the complete set of all frequent, closed subgraphs. However, in many cases only a subset of the freq...
Jianyong Wang, Zhiping Zeng, Lizhu Zhou
JCST
2008
124views more  JCST 2008»
13 years 5 months ago
Clustering by Pattern Similarity
The task of clustering is to identify classes of similar objects among a set of objects. The definition of similarity varies from one clustering model to another. However, in most ...
Haixun Wang, Jian Pei
BMCBI
2006
170views more  BMCBI 2006»
13 years 5 months ago
Biclustering of gene expression data by non-smooth non-negative matrix factorization
Background: The extended use of microarray technologies has enabled the generation and accumulation of gene expression datasets that contain expression levels of thousands of gene...
Pedro Carmona-Saez, Roberto D. Pascual-Marqui, Fra...
KDD
2005
ACM
91views Data Mining» more  KDD 2005»
14 years 6 months ago
On mining cross-graph quasi-cliques
Joint mining of multiple data sets can often discover interesting, novel, and reliable patterns which cannot be obtained solely from any single source. For example, in cross-marke...
Jian Pei, Daxin Jiang, Aidong Zhang