Sciweavers

1463 search results - page 262 / 293
» Adaptive Focused Crawling
Sort
View
KDD
2007
ACM
181views Data Mining» more  KDD 2007»
14 years 9 months ago
BoostCluster: boosting clustering by pairwise constraints
Data clustering is an important task in many disciplines. A large number of studies have attempted to improve clustering by using the side information that is often encoded as pai...
Yi Liu, Rong Jin, Anil K. Jain
KDD
2004
ACM
114views Data Mining» more  KDD 2004»
14 years 9 months ago
Scalable mining of large disk-based graph databases
Mining frequent structural patterns from graph databases is an interesting problem with broad applications. Most of the previous studies focus on pruning unfruitful search subspac...
Chen Wang, Wei Wang 0009, Jian Pei, Yongtai Zhu, B...
KDD
2003
ACM
118views Data Mining» more  KDD 2003»
14 years 9 months ago
Generating English summaries of time series data using the Gricean maxims
We are developing technology for generating English textual summaries of time-series data, in three domains: weather forecasts, gas-turbine sensor readings, and hospital intensive...
Somayajulu Sripada, Ehud Reiter, Jim Hunter, Jin Y...
SIGMOD
2009
ACM
184views Database» more  SIGMOD 2009»
14 years 9 months ago
Minimizing the communication cost for continuous skyline maintenance
Existing work in the skyline literature focuses on optimizing the processing cost. This paper aims at minimization of the communication overhead in client-server architectures, wh...
Zhenjie Zhang, Reynold Cheng, Dimitris Papadias, A...
SIGMOD
2008
ACM
138views Database» more  SIGMOD 2008»
14 years 9 months ago
Sampling time-based sliding windows in bounded space
Random sampling is an appealing approach to build synopses of large data streams because random samples can be used for a broad spectrum of analytical tasks. Users are often inter...
Rainer Gemulla, Wolfgang Lehner