2383 search results - page 118 / 477 » Finding Representative Set from Massive Data |
136
click to vote
ISI
2010
Springer
14 years 11 months ago
2010
Springer
Social Media provide an exciting and novel view into social phenomena. The vast amounts of data that can be gathered from the Internet coupled with massively parallel supercomputer...
124
click to vote
JMLR
2010
14 years 8 months ago
2010
We consider a supervised learning setting in which the main cost of learning is the number of training labels and one can obtain a single label for a bag of examples, indicating o...
225
click to vote
ICDE
2006
IEEE
16 years 3 months ago
2006
IEEE
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...
112
click to vote
COLT
2010
Springer
14 years 11 months ago
2010
Springer
We consider the dimensionality-reduction problem (finding a subspace approximation of observed data) for contaminated data in the high dimensional regime, where the number of obse...
111
click to vote
ISCI
2008
15 years 1 months ago
2008
A biclustering algorithm, based on a greedy technique and enriched with a local search strategy to escape poor local minima, is proposed. The algorithm starts with an initial rand...