2372 search results - page 332 / 475 » is 2012 |
152
click to vote
TKDE
2012
13 years 5 months ago
2012
—Online learning algorithms often have to operate in the presence of concept drifts. A recent study revealed that different diversity levels in an ensemble of learning machines a...
257
click to vote
TKDE
2012
13 years 5 months ago
2012
—The pairwise constraints specifying whether a pair of samples should be grouped together or not have been successfully incorporated into the conventional clustering methods such...
172
click to vote
TOCL
2012
13 years 5 months ago
2012
racting these leads us to introduce the notion of a path object category. This is a relatively simple axiomatic framework, which is nonetheless sufficiently strong to allow the con...
163
click to vote
SDM
2012
SIAM
13 years 5 months ago
2012
SIAM
Many high-profile applications pose high-dimensional nearest-neighbor search problems. Yet, it still remains difficult to achieve fast query times for state-of-the-art approache...
152
click to vote
SDM
2012
SIAM
13 years 5 months ago
2012
SIAM
Finding latent factors of the data using matrix factorizations is a tried-and-tested approach in data mining. But finding shared factors over multiple matrices is more novel prob...