Sciweavers

KDD
2007
ACM
122views Data Mining» more  KDD 2007»
15 years 26 days ago
Expertise modeling for matching papers with reviewers
An essential part of an expert-finding task, such as matching reviewers to submitted papers, is the ability to model the expertise of a person based on documents. We evaluate seve...
David M. Mimno, Andrew McCallum
KDD
2007
ACM
135views Data Mining» more  KDD 2007»
15 years 26 days ago
Nestedness and segmented nestedness
Consider each row of a 0-1 dataset as the subset of the
Heikki Mannila, Evimaria Terzi
KDD
2007
ACM
168views Data Mining» more  KDD 2007»
15 years 26 days ago
A probabilistic framework for relational clustering
Relational clustering has attracted more and more attention due to its phenomenal impact in various important applications which involve multi-type interrelated data objects, such...
Bo Long, Zhongfei (Mark) Zhang, Philip S. Yu
KDD
2007
ACM
151views Data Mining» more  KDD 2007»
15 years 26 days ago
Efficient mining of iterative patterns for software specification discovery
Studies have shown that program comprehension takes up to 45% of software development costs. Such high costs are caused by the lack-of documented specification and further aggrava...
Chao Liu 0001, David Lo, Siau-Cheng Khoo
KDD
2007
ACM
181views Data Mining» more  KDD 2007»
15 years 26 days 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
2007
ACM
191views Data Mining» more  KDD 2007»
15 years 26 days ago
Cost-effective outbreak detection in networks
Given a water distribution network, where should we place sensors to quickly detect contaminants? Or, which blogs should we read to avoid missing important stories? These seemingl...
Andreas Krause, Carlos Guestrin, Christos Faloutso...
KDD
2007
ACM
182views Data Mining» more  KDD 2007»
15 years 26 days ago
A fast algorithm for finding frequent episodes in event streams
Frequent episode discovery is a popular framework for mining data available as a long sequence of events. An episode is essentially a short ordered sequence of event types and the...
Srivatsan Laxman, P. S. Sastry, K. P. Unnikrishnan
KDD
2007
ACM
139views Data Mining» more  KDD 2007»
15 years 26 days ago
Raising the baseline for high-precision text classifiers
Many important application areas of text classifiers demand high precision and it is common to compare prospective solutions to the performance of Naive Bayes. This baseline is us...
Aleksander Kolcz, Wen-tau Yih
KDD
2007
ACM
159views Data Mining» more  KDD 2007»
15 years 26 days ago
Practical guide to controlled experiments on the web: listen to your customers not to the hippo
The web provides an unprecedented opportunity to evaluate ideas quickly using controlled experiments, also called randomized experiments (single-factor or factorial designs), A/B ...
Ron Kohavi, Randal M. Henne, Dan Sommerfield
KDD
2007
ACM
184views Data Mining» more  KDD 2007»
15 years 26 days ago
Correlation search in graph databases
Correlation mining has gained great success in many application domains for its ability to capture the underlying dependency between objects. However, the research of correlation ...
Yiping Ke, James Cheng, Wilfred Ng