Sciweavers

SDM
2007
SIAM
104views Data Mining» more  SDM 2007»
14 years 29 days ago
Fast Multilevel Transduction on Graphs
The recent years have witnessed a surge of interest in graphbased semi-supervised learning methods. The common denominator of these methods is that the data are represented by the...
Fei Wang, Changshui Zhang
SDM
2007
SIAM
184views Data Mining» more  SDM 2007»
14 years 29 days ago
Mining Naturally Smooth Evolution of Clusters from Dynamic Data
Many clustering algorithms have been proposed to partition a set of static data points into groups. In this paper, we consider an evolutionary clustering problem where the input d...
Yi Wang, Shi-Xia Liu, Jianhua Feng, Lizhu Zhou
SDM
2007
SIAM
85views Data Mining» more  SDM 2007»
14 years 29 days ago
Kernel Based Detection of Mislabeled Training Examples
The problem of identifying mislabeled training examples has been examined in several studies, with a variety of approaches developed for editing the training data to obtain better...
Hamed Valizadegan, Pang-Ning Tan
SDM
2007
SIAM
143views Data Mining» more  SDM 2007»
14 years 29 days ago
Less is More: Compact Matrix Decomposition for Large Sparse Graphs
Given a large sparse graph, how can we find patterns and anomalies? Several important applications can be modeled as large sparse graphs, e.g., network traffic monitoring, resea...
Jimeng Sun, Yinglian Xie, Hui Zhang, Christos Falo...
SDM
2007
SIAM
96views Data Mining» more  SDM 2007»
14 years 29 days ago
Higher Order Orthogonal Iteration of Tensors (HOOI) and its Relation to PCA and GLRAM
This paper presents a unified view of a number of dimension reduction techniques under the common framework of tensors. Specifically, it is established that PCA, and the recentl...
Bernard N. Sheehan, Yousef Saad
SDM
2007
SIAM
169views Data Mining» more  SDM 2007»
14 years 29 days ago
Rank Aggregation for Similar Items
The problem of combining the ranked preferences of many experts is an old and surprisingly deep problem that has gained renewed importance in many machine learning, data mining, a...
D. Sculley
SDM
2007
SIAM
139views Data Mining» more  SDM 2007»
14 years 29 days 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»
14 years 29 days 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»
14 years 29 days 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