Sciweavers

240 search results - page 31 / 48
» On Efficient Construction of Decision Trees from Large Datab...
Sort
View
SSDBM
1999
IEEE
118views Database» more  SSDBM 1999»
13 years 11 months ago
Evaluation of Ad Hoc OLAP: In-Place Computation
Large scale data analysis and mining activities, such as identifying interesting trends, making unusual patterns to stand out and verifying hypotheses, require sophisticated infor...
Damianos Chatziantoniou
ALGORITHMICA
2002
103views more  ALGORITHMICA 2002»
13 years 7 months ago
Efficient Bulk Operations on Dynamic R-Trees
In recent years there has been an upsurge of interest in spatial databases. A major issue is how to manipulate efficiently massive amounts of spatial data stored on disk in multidi...
Lars Arge, Klaus Hinrichs, Jan Vahrenhold, Jeffrey...
XSYM
2004
Springer
88views Database» more  XSYM 2004»
14 years 27 days ago
Teaching Relational Optimizers About XML Processing
Due to their numerous benefits, relational systems play a major role in storing XML documents. XML also benefits relational systems by providing a means to publish legacy relatio...
Sihem Amer-Yahia, Yannis Kotidis, Divesh Srivastav...
GIS
2008
ACM
14 years 8 months ago
Applying hierarchical graphs to pedestrian indoor navigation
In this paper we propose to apply hierarchical graphs to indoor navigation. The intended purpose is to guide humans in large public buildings and assist them in wayfinding. We sta...
Edgar-Philipp Stoffel, Hans Jürgen Ohlbach, K...
KDD
2002
ACM
140views Data Mining» more  KDD 2002»
14 years 8 months ago
Mining frequent item sets by opportunistic projection
In this paper, we present a novel algorithm OpportuneProject for mining complete set of frequent item sets by projecting databases to grow a frequent item set tree. Our algorithm ...
Junqiang Liu, Yunhe Pan, Ke Wang, Jiawei Han