Sciweavers

1413 search results - page 81 / 283
» Efficient Learning of Semi-structured Data from Queries
Sort
View
SIGMOD
2006
ACM
127views Database» more  SIGMOD 2006»
16 years 6 months ago
Efficient reverse k-nearest neighbor search in arbitrary metric spaces
The reverse k-nearest neighbor (RkNN) problem, i.e. finding all objects in a data set the k-nearest neighbors of which include a specified query object, is a generalization of the...
Elke Achtert, Christian Böhm, Peer Kröge...
304
Voted
DAWAK
2005
Springer
15 years 11 months ago
Nearest Neighbor Search on Vertically Partitioned High-Dimensional Data
Abstract. In this paper, we present a new approach to indexing multidimensional data that is particularly suitable for the efficient incremental processing of nearest neighbor quer...
Evangelos Dellis, Bernhard Seeger, Akrivi Vlachou
ICML
2004
IEEE
16 years 6 months ago
Bayesian inference for transductive learning of kernel matrix using the Tanner-Wong data augmentation algorithm
In kernel methods, an interesting recent development seeks to learn a good kernel from empirical data automatically. In this paper, by regarding the transductive learning of the k...
Zhihua Zhang, Dit-Yan Yeung, James T. Kwok
159
Voted
SAC
2008
ACM
15 years 5 months ago
Efficient concept clustering for ontology learning using an event life cycle on the web
Ontology learning integrates many complementary techniques, including machine learning, natural language processing, and data mining. Specifically, clustering techniques facilitat...
Sangsoo Sung, Seokkyung Chung, Dennis McLeod
MONET
2002
95views more  MONET 2002»
15 years 5 months ago
On Improving the Performance of Cache Invalidation in Mobile Environments
Many cache management schemes designed for mobile environments are based on invalidation reports (IRs). However, IR-based approach suffers from long query latency and it cannot eff...
Guohong Cao