Sciweavers

312 search results - page 33 / 63
» A General Divide and Conquer Approach for Process Mining
Sort
View
KDD
2007
ACM
189views Data Mining» more  KDD 2007»
15 years 11 months ago
Corroborate and learn facts from the web
The web contains lots of interesting factual information about entities, such as celebrities, movies or products. This paper describes a robust bootstrapping approach to corrobora...
Shubin Zhao, Jonathan Betz
86
Voted
KDD
2004
ACM
157views Data Mining» more  KDD 2004»
15 years 4 months ago
On detecting space-time clusters
Detection of space-time clusters is an important function in various domains (e.g., epidemiology and public health). The pioneering work on the spatial scan statistic is often use...
Vijay S. Iyengar
KDD
2008
ACM
104views Data Mining» more  KDD 2008»
15 years 11 months ago
Succinct summarization of transactional databases: an overlapped hyperrectangle scheme
Transactional data are ubiquitous. Several methods, including frequent itemsets mining and co-clustering, have been proposed to analyze transactional databases. In this work, we p...
Yang Xiang, Ruoming Jin, David Fuhry, Feodor F. Dr...
CIKM
2009
Springer
15 years 2 months ago
Building domain-oriented sentiment lexicon by improved information bottleneck
This paper describes an adapted information bottleneck approach for construction of domain-oriented sentiment lexicon. The basic idea is to use three kinds of relationships (WWint...
Weifu Du, Songbo Tan
SIGMOD
2010
ACM
196views Database» more  SIGMOD 2010»
14 years 11 months ago
GAIA: graph classification using evolutionary computation
Discriminative subgraphs are widely used to define the feature space for graph classification in large graph databases. Several scalable approaches have been proposed to mine disc...
Ning Jin, Calvin Young, Wei Wang