Sciweavers

KDD
2006
ACM
146views Data Mining» more  KDD 2006»
14 years 11 months ago
Structure and evolution of online social networks
In this paper, we consider the evolution of structure within large online social networks. We present a series of measurements of two such networks, together comprising in excess ...
Ravi Kumar, Jasmine Novak, Andrew Tomkins
KDD
2006
ACM
122views Data Mining» more  KDD 2006»
14 years 11 months ago
Measuring and extracting proximity in networks
Measuring distance or some other form of proximity between objects is a standard data mining tool. Connection subgraphs were recently proposed as a way to demonstrate proximity be...
Yehuda Koren, Stephen C. North, Chris Volinsky
KDD
2006
ACM
118views Data Mining» more  KDD 2006»
14 years 11 months ago
Reducing the human overhead in text categorization
Many applications in text processing require significant human effort for either labeling large document collections (when learning statistical models) or extrapolating rules from...
Arnd Christian König, Eric Brill
KDD
2006
ACM
150views Data Mining» more  KDD 2006»
14 years 11 months ago
Maximally informative k-itemsets and their efficient discovery
In this paper we present a new approach to mining binary data. We treat each binary feature (item) as a means of distinguishing two sets of examples. Our interest is in selecting ...
Arno J. Knobbe, Eric K. Y. Ho
KDD
2006
ACM
136views Data Mining» more  KDD 2006»
14 years 11 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»
14 years 11 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»
14 years 11 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»
14 years 11 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»
14 years 11 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»
14 years 11 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