Structure-Oriented Algorithms for Comparison of Web Pages Resemblance

Kód výsledku v IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F62690094%3A18450%2F14%3A50003786" target="_blank" >RIV/62690094:18450/14:50003786 - isvavai.cz</a>

Výsledek na webu

<a href="http://dx.doi.org/10.15866/irecap.v4i6.4249" target="_blank" >http://dx.doi.org/10.15866/irecap.v4i6.4249</a>

DOI - Digital Object Identifier

<a href="http://dx.doi.org/10.15866/irecap.v4i6.4249" target="_blank" >10.15866/irecap.v4i6.4249</a>

Jazyk výsledku

angličtina

Název v původním jazyce

Structure-Oriented Algorithms for Comparison of Web Pages Resemblance

Popis výsledku v původním jazyce

Astounding growth of number of web pages, which we have been experienced during the last decade, brings both new opportunities and threats in so called information society. Plagiarism or intellectual property rights represent only a fragment from all issues triggered by the latest development. Since the necessity to compare particular web-based content has become topical, this paper presents three algorithms for structural comparison of web pages. Three novel algorithms, namely the frequency analysis, the sequence analysis and the identification of the largest sub-tree, are experimentally tested in the developed software application. Results reveal that all algorithms are usable and reliable. Furthermore, the time characteristics related to all algorithms indicate that their execution speed and computational complexity can be successfully compared to other available algorithms. Although there are certain limitations, implications are obvious and research results provide readers with fu

Název v anglickém jazyce

Structure-Oriented Algorithms for Comparison of Web Pages Resemblance

Popis výsledku anglicky

Astounding growth of number of web pages, which we have been experienced during the last decade, brings both new opportunities and threats in so called information society. Plagiarism or intellectual property rights represent only a fragment from all issues triggered by the latest development. Since the necessity to compare particular web-based content has become topical, this paper presents three algorithms for structural comparison of web pages. Three novel algorithms, namely the frequency analysis, the sequence analysis and the identification of the largest sub-tree, are experimentally tested in the developed software application. Results reveal that all algorithms are usable and reliable. Furthermore, the time characteristics related to all algorithms indicate that their execution speed and computational complexity can be successfully compared to other available algorithms. Although there are certain limitations, implications are obvious and research results provide readers with fu

Druh

J_x - Nezařazeno - Článek v odborném periodiku (Jimp, Jsc a Jost)

CEP obor

IN - Informatika

OECD FORD obor

—

Projekt

—

Návaznosti

S - Specificky vyzkum na vysokych skolach

Rok uplatnění

2014

Kód důvěrnosti údajů

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

Název periodika

International journal on communications antenna and propagation

ISSN

2039-5086

e-ISSN

—

Svazek periodika

4

Číslo periodika v rámci svazku

6

Stát vydavatele periodika

IT - Italská republika

Počet stran výsledku

8

Strana od-do

221-228

Kód UT WoS článku

—

EID výsledku v databázi Scopus

—