Sciweavers

KDD
2005
ACM
124views Data Mining» more  KDD 2005»
14 years 9 months ago
A multinomial clustering model for fast simulation of computer architecture designs
Computer architects utilize simulation tools to evaluate the merits of a new design feature. The time needed to adequately evaluate the tradeoffs associated with adding any new fe...
Kaushal Sanghai, Ting Su, Jennifer G. Dy, David R....
KDD
2005
ACM
118views Data Mining» more  KDD 2005»
14 years 9 months ago
On the use of linear programming for unsupervised text classification
We propose a new algorithm for dimensionality reduction and unsupervised text classification. We use mixture models as underlying process of generating corpus and utilize a novel,...
Mark Sandler
KDD
2005
ACM
177views Data Mining» more  KDD 2005»
14 years 9 months ago
Query chains: learning to rank from implicit feedback
This paper presents a novel approach for using clickthrough data to learn ranked retrieval functions for web search results. We observe that users searching the web often perform ...
Filip Radlinski, Thorsten Joachims
KDD
2005
ACM
61views Data Mining» more  KDD 2005»
14 years 9 months ago
Short term performance forecasting in enterprise systems
Rob Powers, Moisés Goldszmidt, Ira Cohen
KDD
2005
ACM
103views Data Mining» more  KDD 2005»
14 years 9 months ago
Robust boosting and its relation to bagging
Several authors have suggested viewing boosting as a gradient descent search for a good fit in function space. At each iteration observations are re-weighted using the gradient of...
Saharon Rosset
KDD
2005
ACM
153views Data Mining» more  KDD 2005»
14 years 9 months ago
Improving discriminative sequential learning with rare--but--important associations
Discriminative sequential learning models like Conditional Random Fields (CRFs) have achieved significant success in several areas such as natural language processing, information...
Xuan Hieu Phan, Minh Le Nguyen, Tu Bao Ho, Susumu ...
KDD
2005
ACM
91views Data Mining» more  KDD 2005»
14 years 9 months ago
On mining cross-graph quasi-cliques
Joint mining of multiple data sets can often discover interesting, novel, and reliable patterns which cannot be obtained solely from any single source. For example, in cross-marke...
Jian Pei, Daxin Jiang, Aidong Zhang
KDD
2005
ACM
104views Data Mining» more  KDD 2005»
14 years 9 months ago
A hit-miss model for duplicate detection in the WHO drug safety database
The WHO Collaborating Centre for International Drug Monitoring in Uppsala, Sweden, maintains and analyses the world's largest database of reports on suspected adverse drug re...
Andrew Bate, G. Niklas Norén, Roland Orre
KDD
2005
ACM
73views Data Mining» more  KDD 2005»
14 years 9 months ago
Using relational knowledge discovery to prevent securities fraud
We describe an application of relational knowledge discovery to a key regulatory mission of the National Association of Securities Dealers (NASD). NASD is the world's largest...
Özgür Simsek, David Jensen, Henry G. Gol...
KDD
2005
ACM
127views Data Mining» more  KDD 2005»
14 years 9 months ago
Detection of emerging space-time clusters
We propose a new class of spatio-temporal cluster detection methods designed for the rapid detection of emerging space-time clusters. We focus on the motivating application of pro...
Daniel B. Neill, Andrew W. Moore, Maheshkumar Sabh...