Sciweavers

49 search results - page 9 / 10
» Efficient Space Time Compression to Reduce Test Data Volume ...
Sort
View
ICML
2008
IEEE
14 years 6 months ago
Fast solvers and efficient implementations for distance metric learning
In this paper we study how to improve nearest neighbor classification by learning a Mahalanobis distance metric. We build on a recently proposed framework for distance metric lear...
Kilian Q. Weinberger, Lawrence K. Saul
AUSDM
2008
Springer
211views Data Mining» more  AUSDM 2008»
13 years 7 months ago
LBR-Meta: An Efficient Algorithm for Lazy Bayesian Rules
LBR is a highly accurate classification algorithm, which lazily constructs a single Bayesian rule for each test instance at classification time. However, its computational complex...
Zhipeng Xie
EDBT
2004
ACM
145views Database» more  EDBT 2004»
14 years 5 months ago
CUBE File: A File Structure for Hierarchically Clustered OLAP Cubes
Abstract. Hierarchical clustering has been proved an effective means for physically organizing large fact tables since it reduces significantly the I/O cost during ad hoc OLAP quer...
Nikos Karayannidis, Timos K. Sellis, Yannis Kouvar...
GEOINFO
2004
13 years 6 months ago
Approximate Spatial Query Processing using Raster Signatures
: Nowadays, the database characteristics, such as the huge volume of data, the complexity of the queries, and even the data availability, can demand minutes or hours to process a q...
Leonardo Guerreiro Azevedo, Rodrigo Salvador Monte...
CIKM
2009
Springer
13 years 10 months ago
Space-economical partial gram indices for exact substring matching
Exact substring matching queries on large data collections can be answered using q-gram indices, that store for each occurring q-byte pattern an (ordered) posting list with the po...
Nan Tang, Lefteris Sidirourgos, Peter A. Boncz