Sciweavers

43 search results - page 4 / 9
» Condensed Nearest Neighbor Data Domain Description
Sort
View
ICDE
2010
IEEE
295views Database» more  ICDE 2010»
14 years 2 months ago
K nearest neighbor queries and kNN-Joins in large relational databases (almost) for free
— Finding the k nearest neighbors (kNN) of a query point, or a set of query points (kNN-Join) are fundamental problems in many application domains. Many previous efforts to solve...
Bin Yao, Feifei Li, Piyush Kumar
KDD
2009
ACM
192views Data Mining» more  KDD 2009»
14 years 8 months ago
Time series shapelets: a new primitive for data mining
Classification of time series has been attracting great interest over the past decade. Recent empirical evidence has strongly suggested that the simple nearest neighbor algorithm ...
Lexiang Ye, Eamonn J. Keogh
ICDE
2007
IEEE
206views Database» more  ICDE 2007»
14 years 8 months ago
Efficiently Processing Continuous k-NN Queries on Data Streams
Efficiently processing continuous k-nearest neighbor queries on data streams is important in many application domains, e. g. for network intrusion detection or in querysubscriber ...
Beng Chin Ooi, Christian Böhm, Claudia Plant,...
AAAI
1997
13 years 8 months ago
Symbolic Nearest Mean Classifiers
The minimum-distance classifier summarizes each class with a prototype and then uses a nearest neighbor approach for classification. Three drawbacks of the original minimum-distan...
Piew Datta, Dennis F. Kibler
ICPR
2004
IEEE
14 years 8 months ago
On Classifier Domains of Competence
We study the domain of dominant competence of six popular classifiers in a space of data complexity measurements. We observe that the simplest classifiers, nearest neighbor and li...
Ester Bernadó i Mansilla, Tin Kam Ho