Sciweavers

331 search results - page 19 / 67
» A Clustering Algorithm Based Absorbing Nearest Neighbors
Sort
View
ICASSP
2010
IEEE
13 years 7 months ago
Searching with expectations
Handling large amounts of data, such as large image databases, requires the use of approximate nearest neighbor search techniques. Recently, Hamming embedding methods such as spec...
Harsimrat Sandhawalia, Herve Jegou
MLG
2007
Springer
14 years 1 months ago
Transductive Rademacher Complexities for Learning Over a Graph
Recent investigations [12, 2, 8, 5, 6] and [11, 9] indicate the use of a probabilistic (’learning’) perspective of tasks defined on a single graph, as opposed to the traditio...
Kristiaan Pelckmans, Johan A. K. Suykens
IJCNN
2007
IEEE
14 years 2 months ago
A Piecewise Linear Network Classifier
— A piecewise linear network is discussed which classifies N-dimensional input vectors. The network uses a distance measure to assign incoming input vectors to an appropriate clu...
A. A. Abdurrab, Michael T. Manry, Jiang Li, Sanjee...
RIAO
2004
13 years 9 months ago
Multilingual document clusters discovery
Cross Language Information Retrieval community has brought up search engines over multilingual corpora, and multilingual text categorization systems. In this paper, we focus on th...
Benoît Mathieu, Romaric Besançon, Chr...
ALT
2008
Springer
14 years 4 months ago
Exploiting Cluster-Structure to Predict the Labeling of a Graph
Abstract. The nearest neighbor and the perceptron algorithms are intuitively motivated by the aims to exploit the “cluster” and “linear separation” structure of the data to...
Mark Herbster