Sciweavers

1082 search results - page 39 / 217
» Graph Mining using Graph Pattern Profiles
Sort
View
86
Voted
KDD
2001
ACM
181views Data Mining» more  KDD 2001»
15 years 10 months ago
Co-clustering documents and words using bipartite spectral graph partitioning
Both document clustering and word clustering are well studied problems. Most existing algorithms cluster documents and words separately but not simultaneously. In this paper we pr...
Inderjit S. Dhillon
KDD
2010
ACM
240views Data Mining» more  KDD 2010»
15 years 1 months ago
Diagnosing memory leaks using graph mining on heap dumps
Memory leaks are caused by software programs that prevent the reclamation of memory that is no longer in use. They can cause significant slowdowns, exhaustion of available storag...
Evan K. Maxwell, Godmar Back, Naren Ramakrishnan
90
Voted
ICTAI
2006
IEEE
15 years 3 months ago
Preserving Patterns in Bipartite Graph Partitioning
This paper describes a new bipartite formulation for word-document co-clustering such that hyperclique patterns, strongly affiliated documents in this case, are guaranteed not to ...
Tianming Hu, Chao Qu, Chew Lim Tan, Sam Yuan Sung,...
JOT
2010
126views more  JOT 2010»
14 years 8 months ago
Inferring design patterns using the ReP graph
Abstract Periodic refactoring of a large source code often becomes a necessity especially for long-lived projects. In order to increase maintainability and extensibility of such pr...
Tushar Sharma, Dharanipragada Janakiram
ISSTA
2009
ACM
15 years 4 months ago
Identifying bug signatures using discriminative graph mining
Bug localization has attracted a lot of attention recently. Most existing methods focus on pinpointing a single statement or function call which is very likely to contain bugs. Al...
Hong Cheng, David Lo, Yang Zhou, Xiaoyin Wang, Xif...