Sciweavers

KDD
2005
ACM
181views Data Mining» more  KDD 2005»
14 years 12 months ago
Evaluating similarity measures: a large-scale study in the orkut social network
Online information services have grown too large for users to navigate without the help of automated tools such as collaborative filtering, which makes recommendations to users ba...
Ellen Spertus, Mehran Sahami, Orkut Buyukkokten
KDD
2005
ACM
192views Data Mining» more  KDD 2005»
14 years 12 months ago
Modeling and predicting personal information dissemination behavior
In this paper, we propose a new way to automatically model and predict human behavior of receiving and disseminating information by analyzing the contact and content of personal c...
Xiaodan Song, Ching-Yung Lin, Belle L. Tseng, Ming...
KDD
2005
ACM
86views Data Mining» more  KDD 2005»
14 years 12 months ago
Probabilistic workflow mining
In several organizations, it has become increasingly popular to document and log the steps that makeup a typical business process. In some situations, a normative workflow model o...
Ricardo Silva, Jiji Zhang, James G. Shanahan
KDD
2005
ACM
124views Data Mining» more  KDD 2005»
14 years 12 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 12 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 12 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 12 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 12 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 12 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 12 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