Sciweavers

2450 search results - page 109 / 490
» Mining Model Trees from Spatial Data
Sort
View
CINQ
2004
Springer
180views Database» more  CINQ 2004»
15 years 7 months ago
Interactivity, Scalability and Resource Control for Efficient KDD Support in DBMS
The conflict between resource consumption and query performance in the data mining context often has no satisfactory solution. This not only stands in sharp contrast to the need of...
Matthias Gimbel, Michael Klein, Peter C. Lockemann
118
Voted
BPM
2004
Springer
148views Business» more  BPM 2004»
15 years 7 months ago
Interactive Workflow Mining
Many information systems log event data about executed tasks. Workflow mining is concerned with the derivation of a graphical workflow model out of this data. Experience from appl...
Markus Hammori, Joachim Herbst, Niko Kleiner
218
Voted
GIS
2009
ACM
16 years 4 months ago
Efficient and Secure Distribution of Massive Geo-Spatial Data
Modern geographic databases can contain a large volume of data that need to be distributed to subscribed customers. The data can be modeled as a cube, where typical dimensions inc...
Hao Yuan, Mikhail J. Atallah
PKDD
2005
Springer
167views Data Mining» more  PKDD 2005»
15 years 8 months ago
Hybrid Cost-Sensitive Decision Tree
Cost-sensitive decision tree and cost-sensitive naïve Bayes are both new cost-sensitive learning models proposed recently to minimize the total cost of test and misclassifications...
Shengli Sheng, Charles X. Ling
KDD
2002
ACM
140views Data Mining» more  KDD 2002»
16 years 3 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