Sciweavers

953 search results - page 158 / 191
» Using Clustering and Blade Clusters in the Terabyte Task
Sort
View
ICCV
2007
IEEE
15 years 11 months ago
Classification of Weakly-Labeled Data with Partial Equivalence Relations
In many vision problems, instead of having fully labeled training data, it is easier to obtain the input in small groups, where the data in each group is constrained to be from th...
Sanjiv Kumar, Henry A. Rowley
KDD
2007
ACM
144views Data Mining» more  KDD 2007»
15 years 10 months ago
Fast direction-aware proximity for graph mining
In this paper we study asymmetric proximity measures on directed graphs, which quantify the relationships between two nodes or two groups of nodes. The measures are useful in seve...
Hanghang Tong, Christos Faloutsos, Yehuda Koren
DCC
2006
IEEE
15 years 9 months ago
Compression and Machine Learning: A New Perspective on Feature Space Vectors
The use of compression algorithms in machine learning tasks such as clustering and classification has appeared in a variety of fields, sometimes with the promise of reducing probl...
D. Sculley, Carla E. Brodley
SC
2009
ACM
15 years 4 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...
ICDM
2009
IEEE
112views Data Mining» more  ICDM 2009»
15 years 4 months ago
Resolving Identity Uncertainty with Learned Random Walks
A pervasive problem in large relational databases is identity uncertainty which occurs when multiple entries in a database refer to the same underlying entity in the world. Relati...
Ted Sandler, Lyle H. Ungar, Koby Crammer