ACM DL

Knowledge Discovery from Data (TKDD)

Menu

Search Issue
enter search term and/or author name

Archive


ACM Transactions on Knowledge Discovery from Data (TKDD), Volume 5 Issue 2, February 2011

Introduction to Special Issue on Large-Scale Data Mining
Jimeng Sun, Yan Liu, Jie Tang, Chid Apte
Article No.: 7
DOI: 10.1145/1921632.1921633

HADI: Mining Radii of Large Graphs
U. Kang, Charalampos E. Tsourakakis, Ana Paula Appel, Christos Faloutsos, Jure Leskovec
Article No.: 8
DOI: 10.1145/1921632.1921634

Given large, multimillion-node graphs (e.g., Facebook, Web-crawls, etc.), how do they evolve over time? How are they connected? What are the central nodes and the outliers? In this article we define the Radius plot of a graph and show how it can...

Robust Record Linkage Blocking Using Suffix Arrays and Bloom Filters
Timothy de Vries, Hui Ke, Sanjay Chawla, Peter Christen
Article No.: 9
DOI: 10.1145/1921632.1921635

Record linkage is an important data integration task that has many practical uses for matching, merging and duplicate removal in large and diverse databases. However, quadratic scalability for the brute force approach of comparing all possible...

Temporal Link Prediction Using Matrix and Tensor Factorizations
Daniel M. Dunlavy, Tamara G. Kolda, Evrim Acar
Article No.: 10
DOI: 10.1145/1921632.1921636

The data in many disciplines such as social networks, Web analysis, etc. is link-based, and the link structure can be exploited for many different data mining tasks. In this article, we consider the problem of temporal link prediction: Given link...

Enhancing Clustering Quality through Landmark-Based Dimensionality Reduction
Panagis Magdalinos, Christos Doulkeridis, Michalis Vazirgiannis
Article No.: 11
DOI: 10.1145/1921632.1921637

Scaling up data mining algorithms for data of both high dimensionality and cardinality has been lately recognized as one of the most challenging problems in data mining research. The reason is that typical data mining tasks, such as clustering,...

Clustering Large Attributed Graphs: A Balance between Structural and Attribute Similarities
Hong Cheng, Yang Zhou, Jeffrey Xu Yu
Article No.: 12
DOI: 10.1145/1921632.1921638

Social networks, sensor networks, biological networks, and many other information networks can be modeled as a large graph. Graph vertices represent entities, and graph edges represent their relationships or interactions. In many large graphs,...

Fast Algorithms for Approximating the Singular Value Decomposition
Aditya Krishna Menon, Charles Elkan
Article No.: 13
DOI: 10.1145/1921632.1921639

A low-rank approximation to a matrix A is a matrix with significantly smaller rank than A, and which is close to A according to some norm. Many practical applications involving the use of large matrices focus on low-rank...