Attributes | Values |
---|
rdf:type
| |
rdfs:seeAlso
| |
Description
| - Subsequence matching has appeared to be an ideal approach for solving many problems related to the fields of data mining and similarity retrieval. It has been shown that almost any data class (audio, image, biometrics, signals) is or can be represented by some kind of time series or string of symbols, which can be seen as an input for various subsequence matching approaches. The variety of data types, specific tasks and their partial or full solutions is so wide that the choice, implementation and parametrization of a suitable solution for a given task might be complicated and time-consuming; a possibly fruitful combination of fragments from different research areas may not be obvious nor easy to realize. The leading authors of this field also mention the implementation bias that makes difficult a proper comparison of competing approaches.
- Subsequence matching has appeared to be an ideal approach for solving many problems related to the fields of data mining and similarity retrieval. It has been shown that almost any data class (audio, image, biometrics, signals) is or can be represented by some kind of time series or string of symbols, which can be seen as an input for various subsequence matching approaches. The variety of data types, specific tasks and their partial or full solutions is so wide that the choice, implementation and parametrization of a suitable solution for a given task might be complicated and time-consuming; a possibly fruitful combination of fragments from different research areas may not be obvious nor easy to realize. The leading authors of this field also mention the implementation bias that makes difficult a proper comparison of competing approaches. (en)
|
Title
| - Subsequence Matching Framework
- Subsequence Matching Framework (en)
|
skos:prefLabel
| - Subsequence Matching Framework
- Subsequence Matching Framework (en)
|
skos:notation
| - RIV/00216224:14330/11:00052966!RIV12-MV0-14330___
|
http://linked.open...avai/riv/aktivita
| |
http://linked.open...avai/riv/aktivity
| |
http://linked.open...vai/riv/dodaniDat
| |
http://linked.open...aciTvurceVysledku
| |
http://linked.open.../riv/druhVysledku
| |
http://linked.open...iv/duvernostUdaju
| |
http://linked.open...onomickeParametry
| - Software je využíván zejména vědeckou komunitou. Umožňuje vlastníkovi a jiným uživatelům velmi efektivní vývoj prototypních i reálných aplikací, které využívají vyhledávání podsekvencí.
|
http://linked.open...titaPredkladatele
| |
http://linked.open...dnocenehoVysledku
| |
http://linked.open...ai/riv/idVysledku
| - RIV/00216224:14330/11:00052966
|
http://linked.open...terniIdentifikace
| |
http://linked.open...riv/jazykVysledku
| |
http://linked.open.../riv/klicovaSlova
| - MUFIN; subsequence matching; similarity search; data mining (en)
|
http://linked.open.../riv/klicoveSlovo
| |
http://linked.open...ontrolniKodProRIV
| |
http://linked.open.../licencniPoplatek
| |
http://linked.open...okalizaceVysledku
| |
http://linked.open...in/vavai/riv/obor
| |
http://linked.open...ichTvurcuVysledku
| |
http://linked.open...cetTvurcuVysledku
| |
http://linked.open...vavai/riv/projekt
| |
http://linked.open...UplatneniVysledku
| |
http://linked.open...echnickeParametry
| - Pro využití softwaru je nutné postupovat podle licence GNU GPL. Odpovědná osoba pro jednání: David Novák, Fakulta informatiky, Masarykova univerzita, Botanická 68a, Brno, 602 00, xnovak8@fi.muni.cz, tel. 549495062
|
http://linked.open...iv/tvurceVysledku
| |
http://linked.open...avai/riv/vlastnik
| |
http://linked.open...itiJinymSubjektem
| |
http://localhost/t...ganizacniJednotka
| |