2512 search results - page 245 / 503 » Learning from Highly Structured Data by Decomposition |
155
click to vote
ICCV
2009
IEEE
16 years 9 months ago
2009
IEEE
Clustering performance can often be greatly improved by
leveraging side information. In this paper, we consider constrained
clustering with pairwise constraints, which specify
s...
184
click to vote
FLAIRS
2008
15 years 6 months ago
2008
Hidden Markov models are a powerful technique to model and classify temporal sequences, such as in speech and gesture recognition. However, defining these models is still an art: ...
131
click to vote
ICPR
2010
IEEE
15 years 2 months ago
2010
IEEE
In this paper, an easily implemented semi-supervised graph learning method is presented for dimensionality reduction and clustering, using the most of prior knowledge from limited...
159
click to vote
KDD
2008
ACM
16 years 4 months ago
2008
ACM
Multi-core processors with ever increasing number of cores per chip are becoming prevalent in modern parallel computing. Our goal is to make use of the multi-core as well as multi...
155
click to vote
AAAI
2010
15 years 2 months ago
2010
Multi-instance learning, as other machine learning tasks, also suffers from the curse of dimensionality. Although dimensionality reduction methods have been investigated for many ...