4791 search results - page 124 / 959 » Clustering with partial information |
190
click to vote
PKDD
2005
Springer
15 years 12 months ago
2005
Springer
We consider a problem of elastic matching of time series. We propose an algorithm that automatically determines a subsequence b of a target time series b that best matches a query ...
174
click to vote
JMLR
2010
15 years 1 months ago
2010
This work deals with four classical prediction settings, namely full information, bandit, label efficient and bandit label efficient as well as four different notions of regret: p...
192
click to vote
CVPR
2003
IEEE
16 years 8 months ago
2003
IEEE
We address the problem of robust clustering by combining data partitions (forming a clustering ensemble) produced by multiple clusterings. We formulate robust clustering under an ...
157
click to vote
KBSE
2008
IEEE
16 years 27 days ago
2008
IEEE
The Design Exploration (DE) approach allows a large number of probable end users to communicate with software developers by creating mockups of user interfaces and augmenting the ...
129
click to vote
KDD
2002
ACM
16 years 6 months ago
2002
ACM
Categories and Subject Descriptors Information Storage and Retrieval Clustering General Terms Keywords