Sciweavers

731 search results - page 54 / 147
» Taxonomy-superimposed graph mining
Sort
View
PAKDD
2007
ACM
224views Data Mining» more  PAKDD 2007»
15 years 8 months ago
Graph Nodes Clustering Based on the Commute-Time Kernel
This work presents a kernel method for clustering the nodes of a weighted, undirected, graph. The algorithm is based on a two-step procedure. First, the sigmoid commute-time kernel...
Luh Yen, François Fouss, Christine Decaeste...
PAKDD
2010
ACM
169views Data Mining» more  PAKDD 2010»
15 years 6 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
SIGMOD
2004
ACM
162views Database» more  SIGMOD 2004»
16 years 2 months ago
Graph Indexing: A Frequent Structure-based Approach
Graph has become increasingly important in modelling complicated structures and schemaless data such as proteins, chemical compounds, and XML documents. Given a graph query, it is...
Xifeng Yan, Philip S. Yu, Jiawei Han
KDD
2009
ACM
200views Data Mining» more  KDD 2009»
15 years 8 months ago
Visual analysis of documents with semantic graphs
In this paper, we present a technique for visual analysis of documents based on the semantic representation of text in the form of a directed graph, referred to as semantic graph....
Delia Rusu, Blaz Fortuna, Dunja Mladenic, Marko Gr...
ICDM
2008
IEEE
121views Data Mining» more  ICDM 2008»
15 years 8 months ago
Unifying Unknown Nodes in the Internet Graph Using Semisupervised Spectral Clustering
Most research on Internet topology is based on active measurement methods. A major difficulty in using these tools is that one comes across many unresponsive routers. Different m...
Anat Almog, Jacob Goldberger, Yuval Shavitt