Sciweavers

KDD
2006
ACM
136views Data Mining» more  KDD 2006»
16 years 7 months ago
Mining quantitative correlated patterns using an information-theoretic approach
Existing research on mining quantitative databases mainly focuses on mining associations. However, mining associations is too expensive to be practical in many cases. In this pape...
Yiping Ke, James Cheng, Wilfred Ng
KDD
2006
ACM
165views Data Mining» more  KDD 2006»
16 years 7 months ago
Training linear SVMs in linear time
Linear Support Vector Machines (SVMs) have become one of the most prominent machine learning techniques for highdimensional sparse data commonly encountered in applications like t...
Thorsten Joachims
KDD
2006
ACM
198views Data Mining» more  KDD 2006»
16 years 7 months ago
CFI-Stream: mining closed frequent itemsets in data streams
Mining frequent closed itemsets provides complete and condensed information for non-redundant association rules generation. Extensive studies have been done on mining frequent clo...
Nan Jiang, Le Gruenwald
KDD
2006
ACM
201views Data Mining» more  KDD 2006»
16 years 7 months ago
Polynomial association rules with applications to logistic regression
A new class of associations (polynomial itemsets and polynomial association rules) is presented which allows for discovering nonlinear relationships between numeric attributes wit...
Szymon Jaroszewicz
KDD
2006
ACM
127views Data Mining» more  KDD 2006»
16 years 7 months ago
Recommendation method for extending subscription periods
Online stores providing subscription services need to extend user subscription periods as long as possible to increase their profits. Conventional recommendation methods recommend...
Tomoharu Iwata, Kazumi Saito, Takeshi Yamada
KDD
2006
ACM
240views Data Mining» more  KDD 2006»
16 years 7 months ago
Adaptive event detection with time-varying poisson processes
Time-series of count data are generated in many different contexts, such as web access logging, freeway traffic monitoring, and security logs associated with buildings. Since this...
Alexander T. Ihler, Jon Hutchins, Padhraic Smyth
KDD
2006
ACM
208views Data Mining» more  KDD 2006»
16 years 7 months ago
Frequent subgraph mining in outerplanar graphs
In recent years there has been an increased interest in frequent pattern discovery in large databases of graph structured objects. While the frequent connected subgraph mining pro...
Tamás Horváth, Jan Ramon, Stefan Wro...
KDD
2006
ACM
180views Data Mining» more  KDD 2006»
16 years 7 months ago
Learning the unified kernel machines for classification
Kernel machines have been shown as the state-of-the-art learning techniques for classification. In this paper, we propose a novel general framework of learning the Unified Kernel ...
Steven C. H. Hoi, Michael R. Lyu, Edward Y. Chang
KDD
2006
ACM
118views Data Mining» more  KDD 2006»
16 years 7 months ago
Mining for proposal reviewers: lessons learned at the national science foundation
In this paper, we discuss a prototype application deployed at the U.S. National Science Foundation for assisting program directors in identifying reviewers for proposals. The appl...
Seth Hettich, Michael J. Pazzani
KDD
2006
ACM
113views Data Mining» more  KDD 2006»
16 years 7 months ago
A new efficient probabilistic model for mining labeled ordered trees
Mining frequent patterns is a general and important issue in data mining. Complex and unstructured (or semi-structured) datasets have appeared in major data mining applications, i...
Kosuke Hashimoto, Kiyoko F. Aoki-Kinoshita, Nobuhi...