1658 search results - page 142 / 332 » Learning Unknown Graphs |
128
click to vote
ECML
2006
Springer
15 years 4 months ago
2006
Springer
We propose preprocessing spectral clustering with b-matching to remove spurious edges in the adjacency graph prior to clustering. B-matching is a generalization of traditional maxi...
129
click to vote
NIPS
2008
15 years 4 months ago
2008
In solving complex visual learning tasks, adopting multiple descriptors to more precisely characterize the data has been a feasible way for improving performance. These representa...
136
Voted
FLAIRS
2010
15 years 5 months ago
2010
Nowadays, graph-based knowledge discovery algorithms do not consider numeric attributes (they are discarded in the preprocessing step, or they are treated as alphanumeric values w...
119
click to vote
ACL
2008
15 years 4 months ago
2008
Previous studies of data-driven dependency parsing have shown that the distribution of parsing errors are correlated with theoretical properties of the models used for learning an...
86
Voted
DAM
2006
15 years 2 months ago
2006
Motivated by issues in machine learning and statistical pattern classification, we investigate a class cover problem (CCP) with an associated family of directed graphs--class cove...