Sciweavers

7150 search results - page 792 / 1430
» Graph-Based Data Mining
Sort
View
209
Voted
KDD
2006
ACM
115views Data Mining» more  KDD 2006»
16 years 7 months ago
Aggregating time partitions
Partitions of sequential data exist either per se or as a result of sequence segmentation algorithms. It is often the case that the same timeline is partitioned in many different ...
Evimaria Terzi, Panayiotis Tsaparas, Taneli Mielik...
212
Voted
KDD
2006
ACM
157views Data Mining» more  KDD 2006»
16 years 7 months ago
Using structure indices for efficient approximation of network properties
Statistics on networks have become vital to the study of relational data drawn from areas such as bibliometrics, fraud detection, bioinformatics, and the Internet. Calculating man...
Matthew J. Rattigan, Marc Maier, David Jensen
KDD
2006
ACM
166views Data Mining» more  KDD 2006»
16 years 7 months ago
Anonymizing sequential releases
An organization makes a new release as new information become available, releases a tailored view for each data request, releases sensitive information and identifying information...
Ke Wang, Benjamin C. M. Fung
ICDM
2009
IEEE
148views Data Mining» more  ICDM 2009»
16 years 1 months ago
Hierarchical Bayesian Models for Collaborative Tagging Systems
—Collaborative tagging systems with user generated content have become a fundamental element of websites such as Delicious, Flickr or CiteULike. By sharing common knowledge, mass...
Markus Bundschus, Shipeng Yu, Volker Tresp, Achim ...
PKDD
2009
Springer
175views Data Mining» more  PKDD 2009»
16 years 1 months ago
Latent Dirichlet Bayesian Co-Clustering
Co-clustering has emerged as an important technique for mining contingency data matrices. However, almost all existing coclustering algorithms are hard partitioning, assigning each...
Pu Wang, Carlotta Domeniconi, Kathryn B. Laskey