Sciweavers

284 search results - page 56 / 57
» Mining Frequent Itemsets in Distributed and Dynamic Database...
Sort
View
KDD
2000
ACM
101views Data Mining» more  KDD 2000»
13 years 9 months ago
Incremental quantile estimation for massive tracking
Data--call records, internet packet headers, or other transaction records--are coming down a pipe at a ferocious rate, and we need to monitor statistics of the data. There is no r...
Fei Chen, Diane Lambert, José C. Pinheiro
KDD
2012
ACM
194views Data Mining» more  KDD 2012»
11 years 7 months ago
A sparsity-inducing formulation for evolutionary co-clustering
Traditional co-clustering methods identify block structures from static data matrices. However, the data matrices in many applications are dynamic; that is, they evolve smoothly o...
Shuiwang Ji, Wenlu Zhang, Jun Liu
IPPS
2006
IEEE
13 years 11 months ago
Design and analysis of a multi-dimensional data sampling service for large scale data analysis applications
Sampling is a widely used technique to increase efficiency in database and data mining applications operating on large dataset. In this paper we present a scalable sampling imple...
Xi Zhang, Tahsin M. Kurç, Joel H. Saltz, Sr...
KDD
2008
ACM
232views Data Mining» more  KDD 2008»
14 years 5 months ago
Anticipating annotations and emerging trends in biomedical literature
The BioJournalMonitor is a decision support system for the analysis of trends and topics in the biomedical literature. Its main goal is to identify potential diagnostic and therap...
Bernd Wachmann, Dmitriy Fradkin, Fabian Mörch...
KDD
2007
ACM
159views Data Mining» more  KDD 2007»
14 years 5 months ago
Constraint-driven clustering
Clustering methods can be either data-driven or need-driven. Data-driven methods intend to discover the true structure of the underlying data while need-driven methods aims at org...
Rong Ge, Martin Ester, Wen Jin, Ian Davidson