Sciweavers

KDD
2009
ACM
150views Data Mining» more  KDD 2009»
15 years 12 days ago
Information theoretic regularization for semi-supervised boosting
We present novel semi-supervised boosting algorithms that incrementally build linear combinations of weak classifiers through generic functional gradient descent using both labele...
Lei Zheng, Shaojun Wang, Yan Liu, Chi-Hoon Lee
KDD
2009
ACM
227views Data Mining» more  KDD 2009»
15 years 12 days ago
User grouping behavior in online forums
Online forums represent one type of social media that is particularly rich for studying human behavior in information seeking and diffusing. The way users join communities is a re...
Xiaolin Shi, Jun Zhu, Rui Cai, Lei Zhang
KDD
2009
ACM
168views Data Mining» more  KDD 2009»
15 years 12 days ago
Sustainable operation and management of data center chillers using temporal data mining
Motivation: Data centers are a critical component of modern IT infrastructure but are also among the worst environmental offenders through their increasing energy usage and the re...
Debprakash Patnaik, Manish Marwah, Ratnesh K. Shar...
KDD
2009
ACM
202views Data Mining» more  KDD 2009»
15 years 12 days ago
Correlated itemset mining in ROC space: a constraint programming approach
Correlated or discriminative pattern mining is concerned with finding the highest scoring patterns w.r.t. a correlation measure (such as information gain). By reinterpreting corre...
Siegfried Nijssen, Tias Guns, Luc De Raedt
KDD
2009
ACM
167views Data Mining» more  KDD 2009»
15 years 12 days ago
SNARE: a link analytic system for graph labeling and risk detection
Classifying nodes in networks is a task with a wide range of applications. It can be particularly useful in anomaly and fraud detection. Many resources are invested in the task of...
Mary McGlohon, Stephen Bay, Markus G. Anderle, Dav...
KDD
2009
ACM
179views Data Mining» more  KDD 2009»
15 years 12 days ago
Connections between the lines: augmenting social networks with text
Jonathan Chang, Jordan L. Boyd-Graber, David M. Bl...
KDD
2009
ACM
228views Data Mining» more  KDD 2009»
15 years 12 days ago
A generalized Co-HITS algorithm and its application to bipartite graphs
Recently many data types arising from data mining and Web search applications can be modeled as bipartite graphs. Examples include queries and URLs in query logs, and authors and ...
Hongbo Deng, Michael R. Lyu, Irwin King
KDD
2009
ACM
269views Data Mining» more  KDD 2009»
15 years 12 days ago
Extracting discriminative concepts for domain adaptation in text mining
One common predictive modeling challenge occurs in text mining problems is that the training data and the operational (testing) data are drawn from different underlying distributi...
Bo Chen, Wai Lam, Ivor Tsang, Tak-Lam Wong
KDD
2009
ACM
611views Data Mining» more  KDD 2009»
15 years 12 days ago
Fast approximate spectral clustering
Spectral clustering refers to a flexible class of clustering procedures that can produce high-quality clusterings on small data sets but which has limited applicability to large-s...
Donghui Yan, Ling Huang, Michael I. Jordan
KDD
2009
ACM
243views Data Mining» more  KDD 2009»
15 years 12 days ago
Exploiting Wikipedia as external knowledge for document clustering
In traditional text clustering methods, documents are represented as "bags of words" without considering the semantic information of each document. For instance, if two ...
Xiaohua Hu, Xiaodan Zhang, Caimei Lu, E. K. Park, ...