Sciweavers

2450 search results - page 73 / 490
» Mining Model Trees from Spatial Data
Sort
View
152
Voted
SSDBM
2002
IEEE
149views Database» more  SSDBM 2002»
15 years 5 months ago
A Cost Model for Interval Intersection Queries on RI-Trees
The efficient management of interval data represents a core requirement for many temporal and spatial database applications. With the Relational Interval Tree (RI-tree1 ), an effi...
Hans-Peter Kriegel, Martin Pfeifle, Marco Pöt...
DAWAK
2005
Springer
15 years 6 months ago
A Tree Comparison Approach to Detect Changes in Data Warehouse Structures
Abstract. We present a technique for discovering and representing changes between versions of data warehouse structures. We select a tree comparison algorithm, adapt it for the par...
Johann Eder, Christian Koncilia, Karl Wiggisser
ICDE
2002
IEEE
104views Database» more  ICDE 2002»
16 years 2 months ago
Efficient Evaluation of Queries with Mining Predicates
Modern relational database systems are beginning to support ad hoc queries on mining models. In this paper, we explore novel techniques for optimizing queries that apply mining mo...
Surajit Chaudhuri, Vivek R. Narasayya, Sunita Sara...
ICDM
2006
IEEE
137views Data Mining» more  ICDM 2006»
15 years 6 months ago
Automatic Construction of N-ary Tree Based Taxonomies
Hierarchies are an intuitive and effective organization paradigm for data. Of late there has been considerable research on automatically learning hierarchical organizations of dat...
Kunal Punera, Suju Rajan, Joydeep Ghosh
VLDB
1998
ACM
120views Database» more  VLDB 1998»
15 years 4 months ago
PUBLIC: A Decision Tree Classifier that Integrates Building and Pruning
Classification is an important problem in data mining. Given a database of records, each with a class label, a classifier generates a concise and meaningful description for each c...
Rajeev Rastogi, Kyuseok Shim