Sciweavers

7150 search results - page 908 / 1430
» Graph-Based Data Mining
Sort
View
ICDM
2002
IEEE
139views Data Mining» more  ICDM 2002»
15 years 11 months ago
An Incremental Approach to Building a Cluster Hierarchy
In this paper we present a novel Incremental Hierarchical Clustering (IHC) algorithm. Our approach aims to construct a hierarchy that satisfies the homogeneity and the monotonici...
Dwi H. Widyantoro, Thomas R. Ioerger, John Yen
PAKDD
2010
ACM
128views Data Mining» more  PAKDD 2010»
15 years 11 months ago
Privacy-Preserving Network Aggregation
Abstract. Consider the scenario where information about a large network is distributed across several different parties or commercial entities. Intuitively, we would expect that th...
Troy Raeder, Marina Blanton, Nitesh V. Chawla, Kei...
PAKDD
2010
ACM
222views Data Mining» more  PAKDD 2010»
15 years 11 months ago
Online Sampling of High Centrality Individuals in Social Networks
In this work, we investigate the use of online or “crawling” algorithms to sample large social networks in order to determine the most influential or important individuals wit...
Arun S. Maiya, Tanya Y. Berger-Wolf
PAKDD
2010
ACM
169views Data Mining» more  PAKDD 2010»
15 years 11 months ago
oddball: Spotting Anomalies in Weighted Graphs
Given a large, weighted graph, how can we find anomalies? Which rules should be violated, before we label a node as an anomaly? We propose the OddBall algorithm, to find such nod...
Leman Akoglu, Mary McGlohon, Christos Faloutsos
178
Voted
PAKDD
2010
ACM
189views Data Mining» more  PAKDD 2010»
15 years 11 months ago
Subsequence Matching of Stream Synopses under the Time Warping Distance
In this paper, we propose a method for online subsequence matching between histogram-based stream synopsis structures under the dynamic warping distance. Given a query synopsis pat...
Su-Chen Lin, Mi-Yen Yeh, Ming-Syan Chen