Sciweavers

4761 search results - page 786 / 953
» Generalizing Boundary Points
Sort
View
ICDM
2010
IEEE
135views Data Mining» more  ICDM 2010»
15 years 2 months ago
Learning a Bi-Stochastic Data Similarity Matrix
An idealized clustering algorithm seeks to learn a cluster-adjacency matrix such that, if two data points belong to the same cluster, the corresponding entry would be 1; otherwise ...
Fei Wang, Ping Li, Arnd Christian König
114
Voted
ICPR
2010
IEEE
15 years 2 months ago
Improving SIFT-based Descriptors Stability to Rotations
Image descriptors are widely adopted structures to match image features. SIFT-based descriptors are collections of gradient orientation histograms computed on different feature re...
Fabio Bellavia, Domenico Tegolo, Emanuele Trucco
139
Voted
ICPR
2010
IEEE
15 years 2 months ago
Boosting Bayesian MAP Classification
In this paper we redefine and generalize the classic k-nearest neighbors (k-NN) voting rule in a Bayesian maximum-a-posteriori (MAP) framework. Therefore, annotated examples are u...
Paolo Piro, Richard Nock, Frank Nielsen, Michel Ba...
115
Voted
ICPR
2010
IEEE
15 years 2 months ago
Data Classification on Multiple Manifolds
Unlike most previous manifold-based data classification algorithms assume that all the data points are on a single manifold, we expect that data from different classes may reside ...
Rui Xiao, Qijun Zhao, David Zhang, Pengfei Shi
MOBIHOC
2010
ACM
15 years 2 months ago
Fine-grained mobility characterization: steady and transient state behaviors
Recent popularization of personal hand-held mobile devices makes it important to characterize the mobility pattern of mobile device users, so as to accurately predict user mobilit...
Wei Gao, Guohong Cao