731 search results - page 63 / 147 » Taxonomy-superimposed graph mining |
107
click to vote
ADMA
2008
Springer
15 years 1 months ago
2008
Springer
With a large number of news available on the internet everyday, it is an interesting work to automatically organize news events by time order and dependencies between events. The w...
114
click to vote
GFKL
2005
Springer
15 years 5 months ago
2005
Springer
Abstract. The problem of clustering data can be formulated as a graph partitioning problem. In this setting, spectral methods for obtaining optimal solutions have received a lot of...
102
click to vote
PKDD
2005
Springer
15 years 5 months ago
2005
Springer
Abstract. Several new miners for frequent subgraphs have been published recently. Whereas new approaches are presented in detail, the quantitative evaluations are often of limited ...
124
click to vote
IOR
2011
14 years 6 months ago
2011
This paper introduces and studies the maximum k-plex problem, which arises in social network analysis and has wider applicability in several important areas employing graph-based ...
DAWAK
2007
Springer
15 years 6 months ago
2007
Springer
In this paper, we deal with the problem of performing what-if analysis for changes that occur in the schema/structure of the data warehouse We abstract software modules, queries, r...