All

What are you looking for?

All
Projects
Results
Organizations

Quick search

  • Projects supported by TA ČR
  • Excellent projects
  • Projects with the highest public support
  • Current projects

Smart search

  • That is how I find a specific +word
  • That is how I leave the -word out of the results
  • “That is how I can find the whole phrase”

A genetic algorithm for discriminative graph pattern mining

The result's identifiers

  • Result code in IS VaVaI

    <a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216224%3A14330%2F19%3A00110952" target="_blank" >RIV/00216224:14330/19:00110952 - isvavai.cz</a>

  • Result on the web

    <a href="http://dx.doi.org/10.1145/3331076.3331113" target="_blank" >http://dx.doi.org/10.1145/3331076.3331113</a>

  • DOI - Digital Object Identifier

    <a href="http://dx.doi.org/10.1145/3331076.3331113" target="_blank" >10.1145/3331076.3331113</a>

Alternative languages

  • Result language

    angličtina

  • Original language name

    A genetic algorithm for discriminative graph pattern mining

  • Original language description

    Real-world networks typically evolve through time, which means there are various events occurring, such as edge additions or at- tribute changes. We propose a new algorithm for mining discriminative patterns of events in such dynamic graphs. This is dierent from other approaches, which typically discriminate whole static graphs while we focus on subgraphs that represent local events. Three tools have been employed The algorithm uses random walks and a nested genetic algo- rithm to nd the patterns through inexact matching. Furthermore, it does not require the time to be discretized as other algorithms commonly do. We have evaluated the algorithm on real-world graph data like DBLP and Enron. We show that the method outperforms baseline algorithm for all data sets and that the increase of accuracy is quite high, between 2.5for NIPS vs. KDD from DBLP dataset and 30% for Enron dataset. We also discus possible extensions of the algorithm.

  • Czech name

  • Czech description

Classification

  • Type

    D - Article in proceedings

  • CEP classification

  • OECD FORD branch

    10200 - Computer and information sciences

Result continuities

  • Project

  • Continuities

    S - Specificky vyzkum na vysokych skolach

Others

  • Publication year

    2019

  • Confidentiality

    S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Data specific for result type

  • Article name in the collection

    Proceedings of the 23rd International Database Applications & Engineering Symposium, IDEAS 2019, Athens, Greece

  • ISBN

    9781450362498

  • ISSN

  • e-ISSN

  • Number of pages

    2

  • Pages from-to

    461-462

  • Publisher name

    ACM

  • Place of publication

    New York

  • Event location

    Athens

  • Event date

    Jan 1, 2019

  • Type of event by nationality

    WRD - Celosvětová akce

  • UT code for WoS article