Sciweavers

280 search results - page 16 / 56
» Efficient Calculation of the Complete Optimal Classification...
Sort
View
112
Voted
ICPR
2002
IEEE
16 years 4 months ago
Prototype Selection for Finding Efficient Representations of Dissimilarity Data
The nearest neighbor (NN) rule is a simple and intuitive method for solving classification problems. Originally, it uses distances to the complete training set. It performs well, ...
Elzbieta Pekalska, Robert P. W. Duin
SAC
2002
ACM
15 years 3 months ago
Decision tree classification of spatial data streams using Peano Count Trees
Many organizations have large quantities of spatial data collected in various application areas, including remote sensing, geographical information systems (GIS), astronomy, compu...
Qiang Ding, Qin Ding, William Perrizo
135
Voted
AIPS
2010
15 years 3 months ago
Iterative Learning of Weighted Rule Sets for Greedy Search
Greedy search is commonly used in an attempt to generate solutions quickly at the expense of completeness and optimality. In this work, we consider learning sets of weighted actio...
Yuehua Xu, Alan Fern, Sung Wook Yoon
115
Voted
IOR
2008
85views more  IOR 2008»
15 years 3 months ago
Equity-Efficiency Bicriteria Location with Squared Euclidean Distances
A facility has to be located within a given region taking two criteria of equity and efficiency into account. Equity is sought by minimizing the inequality in the inhabitant-facil...
Yoshiaki Ohsawa, Naoya Ozaki, Frank Plastria
115
Voted
ICML
2009
IEEE
16 years 4 months ago
Discriminative k-metrics
The k q-flats algorithm is a generalization of the popular k-means algorithm where q dimensional best fit affine sets replace centroids as the cluster prototypes. In this work, a ...
Arthur Szlam, Guillermo Sapiro