2227 search results - page 20 / 446 » Graph Mining based on a Data Partitioning Approach |
106
Voted
PKDD
2010
Springer
14 years 10 months ago
2010
Springer
Defect localisation is essential in software engineering and is an important task in domain-specific data mining. Existing techniques building on call-graph mining can localise dif...
KDD
2007
ACM
16 years 24 days ago
2007
ACM
We present a document routing and index partitioning scheme for scalable similarity-based search of documents in a large corpus. We consider the case when similarity-based search ...
BPM
2003
Springer
15 years 4 months ago
2003
Springer
This paper presents an approach on mining most specific workflow models from event-based data. The approach is embedded in the context of data mining and knowledge discovery in dat...
99
Voted
SAC
2010
ACM
15 years 7 months ago
2010
ACM
This article addresses the problem of efficient multi-robot patrolling in a known environment. The proposed approach assigns regions to each mobile agent. Every region is represen...
119
Voted
ICPR
2008
IEEE
16 years 1 months ago
2008
IEEE
Many existing spectral clustering algorithms share a conventional graph partitioning criterion: normalized cuts (NC). However, one problem with NC is that it poorly captures the g...