Sciweavers

2277 search results - page 203 / 456
» Clustering by pattern similarity in large data sets
Sort
View
IPPS
2002
IEEE
15 years 11 months ago
Parallel EST Clustering
Expressed sequence tags, abbreviated ESTs, are DNA fragments experimentally derived from expressed portions of genes. Clustering of ESTs is essential for gene recognition and unde...
Anantharaman Kalyanaraman, Srinivas Aluru, Suresh ...
TVCG
2008
125views more  TVCG 2008»
15 years 6 months ago
GrouseFlocks: Steerable Exploration of Graph Hierarchy Space
Several previous systems allow users to interactively explore a large input graph through cuts of a superimposed hierarchy. This hierarchy is often created using clustering algorit...
Daniel Archambault, Tamara Munzner, David Auber
CCGRID
2010
IEEE
15 years 4 months ago
File-Access Characteristics of Data-Intensive Workflow Applications
This paper studies five real-world data intensive workflow applications in the fields of natural language processing, astronomy image analysis, and web data analysis. Data intensiv...
Takeshi Shibata, SungJun Choi, Kenjiro Taura
KDD
2006
ACM
164views Data Mining» more  KDD 2006»
16 years 7 months ago
Sampling from large graphs
Given a huge real graph, how can we derive a representative sample? There are many known algorithms to compute interesting measures (shortest paths, centrality, betweenness, etc.)...
Jure Leskovec, Christos Faloutsos
KDD
2007
ACM
249views Data Mining» more  KDD 2007»
16 years 7 months ago
The minimum consistent subset cover problem and its applications in data mining
In this paper, we introduce and study the Minimum Consistent Subset Cover (MCSC) problem. Given a finite ground set X and a constraint t, find the minimum number of consistent sub...
Byron J. Gao, Martin Ester, Jin-yi Cai, Oliver Sch...