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”

Degree of Similarity of Root Trees

The result's identifiers

  • Result code in IS VaVaI

    <a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21230%2F19%3A00322782" target="_blank" >RIV/68407700:21230/19:00322782 - isvavai.cz</a>

  • Result on the web

    <a href="https://link.springer.com/chapter/10.1007/978-981-13-1056-0_57" target="_blank" >https://link.springer.com/chapter/10.1007/978-981-13-1056-0_57</a>

  • DOI - Digital Object Identifier

    <a href="http://dx.doi.org/10.1007/978-981-13-1056-0_57" target="_blank" >10.1007/978-981-13-1056-0_57</a>

Alternative languages

  • Result language

    angličtina

  • Original language name

    Degree of Similarity of Root Trees

  • Original language description

    Adaptive User Interfaces (UI) provide better user experience as users a receive personalized presentation. These UIs heavily rely on contextual data. Context helps the application to recognize user needs and thus adjust the UI. First time user receives a generalized experience; however, as the user uses the application more often it gathers lots of contextual data, such as the history of actions. This allows to statistically classify user in a user cluster and based on that adapt the UI presentation. This paper considers methods to find a measure of similarity of graphs to support adaptive UIs. To achieve this, it considers rooted trees. It states known approaches, which could be used for calculation of this measure. It focuses on the Simhash algorithm and describes its implementation in the SimCom experimental comparative application. Its results show that Simhash can be used for comparing the rooted trees. The main aim of this paper is to show novel view on how to use graph algorithms and clustering of trees into adaptive application structure.

  • Czech name

  • Czech description

Classification

  • Type

    D - Article in proceedings

  • CEP classification

  • OECD FORD branch

    10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)

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

    Lecture Notes in Electrical Engineering

  • ISBN

    9789811310553

  • ISSN

    1876-1100

  • e-ISSN

  • Number of pages

    11

  • Pages from-to

    581-591

  • Publisher name

    Springer Nature Singapore Pte Ltd.

  • Place of publication

  • Event location

    Kawloon

  • Event date

    Jun 25, 2018

  • Type of event by nationality

    WRD - Celosvětová akce

  • UT code for WoS article