Sciweavers

1146 search results - page 78 / 230
» Optimizing Frequency Queries for Data Mining Applications
Sort
View
VLDB
2004
ACM
100views Database» more  VLDB 2004»
14 years 2 months ago
Online Balancing of Range-Partitioned Data with Applications to Peer-to-Peer Systems
We consider the problem of horizontally partitioning a dynamic relation across a large number of disks/nodes by the use of range partitioning. Such partitioning is often desirable...
Prasanna Ganesan, Mayank Bawa, Hector Garcia-Molin...
SIGMOD
2006
ACM
232views Database» more  SIGMOD 2006»
14 years 9 months ago
To search or to crawl?: towards a query optimizer for text-centric tasks
Text is ubiquitous and, not surprisingly, many important applications rely on textual data for a variety of tasks. As a notable example, information extraction applications derive...
Panagiotis G. Ipeirotis, Eugene Agichtein, Pranay ...
KDD
2006
ACM
109views Data Mining» more  KDD 2006»
14 years 9 months ago
Extracting redundancy-aware top-k patterns
Observed in many applications, there is a potential need of extracting a small set of frequent patterns having not only high significance but also low redundancy. The significance...
Dong Xin, Hong Cheng, Xifeng Yan, Jiawei Han
JIIS
2006
113views more  JIIS 2006»
13 years 9 months ago
Spatial ordering and encoding for geographic data mining and visualization
: Geographic information (e.g., locations, networks, and nearest neighbors) are unique and different from other aspatial attributes (e.g., population, sales, or income). It is a ch...
Diansheng Guo, Mark Gahegan
DAWAK
1999
Springer
14 years 1 months ago
Modeling KDD Processes within the Inductive Database Framework
One of the most challenging problems in data manipulation in the future is to be able to e ciently handle very large databases but also multiple induced properties or generalizatio...
Jean-François Boulicaut, Mika Klemettinen, ...