Sciweavers

17 search results - page 1 / 4
» Input and Structure Selection for k-NN Approximator
Sort
View
IWANN
2005
Springer
13 years 10 months ago
Input and Structure Selection for k-NN Approximator
Abstract. This paper presents k-NN as an approximator for time series prediction problems. The main advantage of this approximator is its simplicity. Despite the simplicity, k-NN c...
Antti Sorjamaa, Nima Reyhani, Amaury Lendasse
ICDE
2007
IEEE
206views Database» more  ICDE 2007»
14 years 6 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,...
IJON
2007
102views more  IJON 2007»
13 years 4 months ago
Methodology for long-term prediction of time series
In this paper, a global methodology for the long-term prediction of time series is proposed. This methodology combines direct prediction strategy and sophisticated input selection...
Antti Sorjamaa, Jin Hao, Nima Reyhani, Yongnan Ji,...
ACIVS
2006
Springer
13 years 10 months ago
A Comparison of Nearest Neighbor Search Algorithms for Generic Object Recognition
The nearest neighbor (NN) classifier is well suited for generic object recognition. However, it requires storing the complete training data, and classification time is linear in ...
Ferid Bajramovic, Frank Mattern, Nicholas Butko, J...
EDBT
2008
ACM
122views Database» more  EDBT 2008»
14 years 5 months ago
Semantic peer, here are the neighbors you want!
Peer Data Management Systems (PDMSs) have been introduced as a solution to the problem of large-scale sharing of semantically rich data. A PDMS consists of semantic peers connecte...
Wilma Penzo, Stefano Lodi, Federica Mandreoli, Ric...