Sciweavers

7581 search results - page 1075 / 1517
» Incompleteness in Data Mining
Sort
View
KDD
2009
ACM
167views Data Mining» more  KDD 2009»
16 years 1 months ago
Anomalous window discovery through scan statistics for linear intersecting paths (SSLIP)
Anomalous windows are the contiguous groupings of data points. In this paper, we propose an approach for discovering anomalous windows using Scan Statistics for Linear Intersectin...
Lei Shi, Vandana Pursnani Janeja
KDD
2005
ACM
125views Data Mining» more  KDD 2005»
16 years 12 days ago
Price prediction and insurance for online auctions
Online auctions are generating a new class of fine-grained data about online transactions. This data lends itself to a variety of applications and services that can be provided to...
Rayid Ghani
KDD
2005
ACM
107views Data Mining» more  KDD 2005»
16 years 12 days ago
Predicting the product purchase patterns of corporate customers
This paper describes TIPPPS (Time Interleaved Product Purchase Prediction System), which analyses billing data of corporate customers in a large telecommunications company in orde...
Bhavani Raskutti, Alan Herschtal
KDD
2009
ACM
180views Data Mining» more  KDD 2009»
15 years 11 months ago
Parallel community detection on large networks with propinquity dynamics
Graphs or networks can be used to model complex systems. Detecting community structures from large network data is a classic and challenging task. In this paper, we propose a nove...
Yuzhou Zhang, Jianyong Wang, Yi Wang, Lizhu Zhou
SDM
2009
SIAM
175views Data Mining» more  SDM 2009»
16 years 4 months ago
Low-Entropy Set Selection.
Most pattern discovery algorithms easily generate very large numbers of patterns, making the results impossible to understand and hard to use. Recently, the problem of instead sel...
Hannes Heikinheimo, Jilles Vreeken, Arno Siebes, H...
« Prev « First page 1075 / 1517 Last » Next »