Sciweavers

574 search results - page 22 / 115
» Maximum Margin Clustering
Sort
View
DATAMINE
2010
133views more  DATAMINE 2010»
13 years 7 months ago
Using background knowledge to rank itemsets
Assessing the quality of discovered results is an important open problem in data mining. Such assessment is particularly vital when mining itemsets, since commonly many of the disc...
Nikolaj Tatti, Michael Mampaey
ACCV
2010
Springer
13 years 2 months ago
Pedestrian Recognition with a Learned Metric
This paper presents a new method for viewpoint invariant pedestrian recognition problem. We use a metric learning framework to obtain a robust metric for large margin nearest neigh...
Mert Dikmen, Emre Akbas, Thomas S. Huang, Narendra...
ICASSP
2009
IEEE
14 years 2 months ago
A complex cross-spectral distribution model using Normal Variance Mean Mixtures
We propose a model for the density of cross-spectral coefficients using Normal Variance Mean Mixtures. We show that this model density generalizes the corresponding marginal dens...
Jason A. Palmer, Scott Makeig, Kenneth Kreutz-Delg...
ICDM
2003
IEEE
71views Data Mining» more  ICDM 2003»
14 years 27 days ago
Tree-structured Partitioning Based on Splitting Histograms of Distances
We propose a novel clustering algorithm that is similar in spirit to classification trees. The data is recursively split using a criterion that applies a discrete curve evolution...
Longin Jan Latecki, Rajagopal Venugopal, Marc Sobe...
COLT
2000
Springer
13 years 12 months ago
Entropy Numbers of Linear Function Classes
This paper collects together a miscellany of results originally motivated by the analysis of the generalization performance of the “maximum-margin” algorithm due to Vapnik and...
Robert C. Williamson, Alex J. Smola, Bernhard Sch&...