Sciweavers

372 search results - page 26 / 75
» Mining the space of graph properties
Sort
View
APN
2008
Springer
13 years 11 months ago
MC-SOG: An LTL Model Checker Based on Symbolic Observation Graphs
Model checking is a powerful and widespread technique for the verification of finite distributed systems. However, the main hindrance for wider application of this technique is the...
Kais Klai, Denis Poitrenaud
SDM
2009
SIAM
149views Data Mining» more  SDM 2009»
14 years 7 months ago
Near-optimal Supervised Feature Selection among Frequent Subgraphs.
Graph classification is an increasingly important step in numerous application domains, such as function prediction of molecules and proteins, computerised scene analysis, and an...
Alexander J. Smola, Arthur Gretton, Hans-Peter Kri...
SADM
2010
123views more  SADM 2010»
13 years 8 months ago
Discriminative frequent subgraph mining with optimality guarantees
The goal of frequent subgraph mining is to detect subgraphs that frequently occur in a dataset of graphs. In classification settings, one is often interested in discovering discr...
Marisa Thoma, Hong Cheng, Arthur Gretton, Jiawei H...
AWIC
2003
Springer
14 years 3 months ago
ROSA - Multi-agent System for Web Services Personalization
Automatic and non-invasive web personalization seems to be a challenge for nowadays web sites. Many web mining techniques are used to achieve this goal. Since current web sites evo...
Przemyslaw Kazienko, Maciej Kiewra
WG
2004
Springer
14 years 3 months ago
Recognizing HHD-free and Welsh-Powell Opposition Graphs
In this paper, we consider the recognition problem on two classes of perfectly orderable graphs, namely, the HHD-free and the Welsh-Powell opposition graphs (or WPO-graphs). In par...
Stavros D. Nikolopoulos, Leonidas Palios