Sciweavers

215 search results - page 13 / 43
» Mining Generalized Graph Patterns Based on User Examples
Sort
View
WWW
2001
ACM
15 years 10 months ago
IEPAD: information extraction based on pattern discovery
The research in information extraction (IE) regards the generation of wrappers that can extract particular information from semistructured Web documents. Similar to compiler gener...
Chia-Hui Chang, Shao-Chen Lui
TSE
2008
113views more  TSE 2008»
14 years 9 months ago
Discovering Neglected Conditions in Software by Mining Dependence Graphs
Neglected conditions are an important but difficult-to-find class of software defects. This paper presents a novel approach for revealing neglected conditions that integrates stati...
Ray-Yaung Chang, Andy Podgurski, Jiong Yang
KDD
2008
ACM
165views Data Mining» more  KDD 2008»
15 years 10 months ago
Colibri: fast mining of large static and dynamic graphs
Low-rank approximations of the adjacency matrix of a graph are essential in finding patterns (such as communities) and detecting anomalies. Additionally, it is desirable to track ...
Hanghang Tong, Spiros Papadimitriou, Jimeng Sun, P...
PAKDD
2011
ACM
214views Data Mining» more  PAKDD 2011»
14 years 13 days ago
Spectral Analysis of k-Balanced Signed Graphs
Abstract. Previous studies on social networks are often focused on networks with only positive relations between individual nodes. As a significant extension, we conduct the spectr...
Leting Wu, Xiaowei Ying, Xintao Wu, Aidong Lu, Zhi...
HPCC
2011
Springer
13 years 9 months ago
Heuristic-Based Techniques for Mapping Irregular Communication Graphs to Mesh Topologies
— Mapping of parallel applications on the network topology is becoming increasingly important on large supercomputers. Topology aware mapping can reduce the hops traveled by mess...
Abhinav Bhatele, Laxmikant V. Kalé