Sciweavers

2556 search results - page 420 / 512
» Clustering processes
Sort
View
KDD
2005
ACM
118views Data Mining» more  KDD 2005»
16 years 4 months ago
On the use of linear programming for unsupervised text classification
We propose a new algorithm for dimensionality reduction and unsupervised text classification. We use mixture models as underlying process of generating corpus and utilize a novel,...
Mark Sandler
KDD
2005
ACM
145views Data Mining» more  KDD 2005»
16 years 4 months ago
Using and Learning Semantics in Frequent Subgraph Mining
The search for frequent subgraphs is becoming increasingly important in many application areas including Web mining and bioinformatics. Any use of graph structures in mining, howev...
Bettina Berendt
119
Voted
ICDE
2010
IEEE
231views Database» more  ICDE 2010»
15 years 10 months ago
Estimating the progress of MapReduce pipelines
Abstract— In parallel query-processing environments, accurate, time-oriented progress indicators could provide much utility given that inter- and intra-query execution times can ...
Kristi Morton, Abram Friesen, Magdalena Balazinska...
146
Voted
ISPASS
2009
IEEE
15 years 10 months ago
Lonestar: A suite of parallel irregular programs
Until recently, parallel programming has largely focused on the exploitation of data-parallelism in dense matrix programs. However, many important application domains, including m...
Milind Kulkarni, Martin Burtscher, Calin Cascaval,...
SC
2009
ACM
15 years 10 months ago
Highly scalable genome assembly on campus grids
Bioinformatics researchers need efficient means to process large collections of sequence data. One application of interest, genome assembly, has great potential for parallelizati...
Christopher Moretti, Michael Olson, Scott J. Emric...