180 search results - page 26 / 36 » Unsupervised Relation Disambiguation Using Spectral Clusteri... |
IDA
2007
Springer
13 years 7 months ago
2007
Springer
Unsupervised sequence learning is important to many applications. A learner is presented with unlabeled sequential data, and must discover sequential patterns that characterize th...
SIGIR
2008
ACM
13 years 7 months ago
2008
ACM
Searching for people on the Web is one of the most common query types to the web search engines today. However, when a person name is queried, the returned webpages often contain ...
NIPS
2004
13 years 9 months ago
2004
We propose a new method for clustering based on finding maximum margin hyperplanes through data. By reformulating the problem in terms of the implied equivalence relation matrix, ...
AIIA
2007
Springer
14 years 1 months ago
2007
Springer
Abstract. A clustering method is presented which can be applied to relational knowledge bases. It can be used to discover interesting groupings of resources through their (semantic...
KDD
2002
ACM
14 years 8 months ago
2002
ACM
We propose a new clustering algorithm, called SyMP, which is based on synchronization of pulse-coupled oscillators. SyMP represents each data point by an Integrate-and-Fire oscill...