Name
Abstract | ||
|---|---|---|
This paper analyses the graph mining problem, and the frequent pattern mining task associated with it. In general, frequent pattern mining looks for a graph which occurs frequently within a network or, in the transactional setting, within a dataset of graphs. We discuss this task in the transactional setting, which is a problem of interest in many fields such as bioinformatics, chemoinformatics and social networks. We look at the graph mining problem from a Knowledge Representation point of view, hoping to learn something about support for higher-order logics in declarative languages and solvers. Graph mining is studied as a prototypical problem; it is easily expressible mathematically and exists in many variations. As such, it appears to be a prime candidate for a declarative approach; one would expect this allows for a clear, structured, statement of the problem combined with easy adaptation to changing requirements and variations. Current state-of-the-art KR languages such as IDP and ASP aspire to be practical solvers for such problems (Bruynooghe, Theory Practice Logic Program. (TPLP) 15(6), 783–817 2015). Nevertheless, expressing the graph mining problem in these languages requires unexpectedly complicated and unintuitive encoding techniques. These techniques are in contrast to the ease with which one can transform the mathematical definition of graph mining to a higher-order logic specification, and distract from the problem essentials, complicating possible future adaptation. In this paper, we argue that efforts should be made towards supporting higher-order logic specifications in modern specification languages, without unintuitive and complicated encoding techniques. We argue that this not only makes representation clearer and more susceptible to future adaptation, but might also allow for faster, more competitive solver techniques to be implemented. |
Year | Venue | Field |
|---|---|---|
2016 | arXiv: Logic in Computer Science | Graph,Discrete mathematics,Knowledge representation and reasoning,Programming language,Computer science,Algorithm,Theoretical computer science,Rewriting,Solver,Disjoint union,Higher-order logic,Encoding (memory) |
DocType | Volume | Citations |
Journal | abs/1608.08956 | 1 |
PageRank | References | Authors |
0.35 | 6 | 4 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Matthias van der Hallen | 1 | 4 | 2.13 |
| Sergey Paramonov | 2 | 17 | 4.72 |
| Michael Leuschel | 3 | 2156 | 135.89 |
| Gerda Janssens | 4 | 644 | 58.82 |