Sciweavers

1542 search results - page 256 / 309
» Redundancy in Spatial Databases
Sort
View
DATESO
2009
119views Database» more  DATESO 2009»
13 years 6 months ago
Efficiency Improvement of Narrow Range Query Processing in R-tree
Indexing methods for efficient processing of multidimensional data are very requested in many fields, like geographical information systems, drawing documentations etc. Well-known ...
Peter Chovanec, Michal Krátký
DATESO
2009
158views Database» more  DATESO 2009»
13 years 6 months ago
Benchmarking Coding Algorithms for the R-tree Compression
Multi-dimensional data structures have been widely applied in many data management fields. Spatial data indexing is their natural application, however there are many applications i...
Jirí Walder, Michal Krátký, R...
KDD
2008
ACM
181views Data Mining» more  KDD 2008»
14 years 9 months ago
Learning subspace kernels for classification
Kernel methods have been applied successfully in many data mining tasks. Subspace kernel learning was recently proposed to discover an effective low-dimensional subspace of a kern...
Jianhui Chen, Shuiwang Ji, Betul Ceran, Qi Li, Min...
KDD
2008
ACM
239views Data Mining» more  KDD 2008»
14 years 9 months ago
Mining adaptively frequent closed unlabeled rooted trees in data streams
Closed patterns are powerful representatives of frequent patterns, since they eliminate redundant information. We propose a new approach for mining closed unlabeled rooted trees a...
Albert Bifet, Ricard Gavaldà
KDD
2008
ACM
264views Data Mining» more  KDD 2008»
14 years 9 months ago
Stable feature selection via dense feature groups
Many feature selection algorithms have been proposed in the past focusing on improving classification accuracy. In this work, we point out the importance of stable feature selecti...
Lei Yu, Chris H. Q. Ding, Steven Loscalzo