Sciweavers

SDM
2007
SIAM
139views Data Mining» more  SDM 2007»
13 years 10 months ago
Dynamic Algorithm for Graph Clustering Using Minimum Cut Tree
We present an efficient dynamic algorithm for clustering undirected graphs, whose edge property is changing continuously. The algorithm maintains clusters of high quality in pres...
Barna Saha, Pabitra Mitra
SDM
2007
SIAM
147views Data Mining» more  SDM 2007»
13 years 10 months ago
Constraint-Based Pattern Set Mining
Local pattern mining algorithms generate sets of patterns, which are typically not directly useful and have to be further processed before actual application or interpretation. Ra...
Luc De Raedt, Albrecht Zimmermann
SDM
2007
SIAM
126views Data Mining» more  SDM 2007»
13 years 10 months ago
Nonlinear Dimensionality Reduction using Approximate Nearest Neighbors
Nonlinear dimensionality reduction methods often rely on the nearest-neighbors graph to extract low-dimensional embeddings that reliably capture the underlying structure of high-d...
Erion Plaku, Lydia E. Kavraki
SDM
2007
SIAM
86views Data Mining» more  SDM 2007»
13 years 10 months ago
Identifying Bundles of Product Options using Mutual Information Clustering
Mass-produced goods tend to be highly standardized in order to maximize manufacturing efficiencies. Some high-value goods with limited production quantities remain much less stand...
Claudia Perlich, Saharon Rosset
SDM
2007
SIAM
167views Data Mining» more  SDM 2007»
13 years 10 months ago
Bandits for Taxonomies: A Model-based Approach
We consider a novel problem of learning an optimal matching, in an online fashion, between two feature spaces that are organized as taxonomies. We formulate this as a multi-armed ...
Sandeep Pandey, Deepak Agarwal, Deepayan Chakrabar...
SDM
2007
SIAM
122views Data Mining» more  SDM 2007»
13 years 10 months ago
Incremental Spectral Clustering With Application to Monitoring of Evolving Blog Communities
In recent years, spectral clustering method has gained attentions because of its superior performance compared to other traditional clustering algorithms such as K-means algorithm...
Huazhong Ning, Wei Xu, Yun Chi, Yihong Gong, Thoma...
SDM
2007
SIAM
143views Data Mining» more  SDM 2007»
13 years 10 months ago
Clustering by weighted cuts in directed graphs
In this paper we formulate spectral clustering in directed graphs as an optimization problem, the objective being a weighted cut in the directed graph. This objective extends seve...
Marina Meila, William Pentney
SDM
2007
SIAM
112views Data Mining» more  SDM 2007»
13 years 10 months ago
PoClustering: Lossless Clustering of Dissimilarity Data
Given a set of objects V with a dissimilarity measure between pairs of objects in V , a PoCluster is a collection of sets P ⊂ powerset(V ) partially ordered by the ⊂ relation ...
Jinze Liu, Qi Zhang, Wei Wang 0010, Leonard McMill...
SDM
2007
SIAM
146views Data Mining» more  SDM 2007»
13 years 10 months ago
ROAM: Rule- and Motif-Based Anomaly Detection in Massive Moving Object Data Sets
With recent advances in sensory and mobile computing technology, enormous amounts of data about moving objects are being collected. One important application with such data is aut...
Xiaolei Li, Jiawei Han, Sangkyum Kim, Hector Gonza...
SDM
2007
SIAM
143views Data Mining» more  SDM 2007»
13 years 10 months ago
Patterns of Cascading Behavior in Large Blog Graphs
How do blogs cite and influence each other? How do such links evolve? Does the popularity of old blog posts drop exponentially with time? These are some of the questions that we ...
Jure Leskovec, Mary McGlohon, Christos Faloutsos, ...