Sciweavers

7150 search results - page 824 / 1430
» Graph-Based Data Mining
Sort
View
KDD
2003
ACM
129views Data Mining» more  KDD 2003»
16 years 7 months ago
Online novelty detection on temporal sequences
: Novelty detection, or anomaly detection, on temporal sequences has increasingly attracted attention from researchers in different areas. In this paper, we present a new framework...
Junshui Ma, Simon Perkins
KDD
2002
ACM
122views Data Mining» more  KDD 2002»
16 years 7 months ago
Hierarchical model-based clustering of large datasets through fractionation and refractionation
The goal of clustering is to identify distinct groups in a dataset. Compared to non-parametric clustering methods like complete linkage, hierarchical model-based clustering has th...
Jeremy Tantrum, Alejandro Murua, Werner Stuetzle
KDD
2001
ACM
156views Data Mining» more  KDD 2001»
16 years 7 months ago
A Customer Purchase Incidence Model Applied to Recommender Services
In this contribution we transfer a customer purchase incidence model for consumer products which is based on Ehrenberg's repeat-buying theory to Web-based information products...
Andreas Geyer-Schulz, Michael Hahsler, Maximillian...
VLDB
2006
ACM
162views Database» more  VLDB 2006»
16 years 7 months ago
Dependency trees in sub-linear time and bounded memory
We focus on the problem of efficient learning of dependency trees. Once grown, they can be used as a special case of a Bayesian network, for PDF approximation, and for many other u...
Dan Pelleg, Andrew W. Moore
SIGMOD
2001
ACM
229views Database» more  SIGMOD 2001»
16 years 7 months ago
A Robust, Optimization-Based Approach for Approximate Answering of Aggregate Queries
The ability to approximately answer aggregation queries accurately and efficiently is of great benefit for decision support and data mining tools. In contrast to previous sampling...
Surajit Chaudhuri, Gautam Das, Vivek R. Narasayya