About: Automated Classification Tree Evolution through Hybrid Metaheuristics     Goto   Sponge   NotDistinct   Permalink

An Entity of Type : http://linked.opendata.cz/ontology/domain/vavai/Vysledek, within Data Space : linked.opendata.cz associated with source document(s)

AttributesValues
rdf:type
Description
  • Zpracování dat je v současné době velice důležitým krokem v mnoha oblastech. KLasifikační stromy přiřazují klasifikaci neznámým datům a lze je také využít pro shlukování dat. Klasifikační strom musí mít přijatelně jednoduchou strukturu a musí se umět vypořádat s hodnotami ležícími zcela mimo (outlier). Výhodou je tzv. white-box struktura. Článek uvádí novou metodu ACO-DTree, která vytváří klasifikační stromy s využitím evoluce, inspirované přírodními procesy. Využívá kombinace evolučních strategií a optimalizace inspirované mravenčími koloniemi. Článek také diskutuje důležité parametry. Uvádít také testy na reálných datech (dtatbáze UCI a MIT-BIH). (cs)
  • In present, data processing is an important process in many organizations. Classification trees are used to assign a classification to unknown data and can be also used for data partitioning (data clustering). The classification tree must be able to cope with outliers and have acceptably simple structure. An important advantage is the white-box structure. This paper presents a novel method called ACO-DTree for classification tree generation and their evolution inspired by natural processes. It uses a hybrid metaheuristics combining evolutionary strategies and ant colony optimization. Proposed method benefits from the stochastic process and population approach, which allows the algorithm to evolve more efficiently than the methods alone. The paper also consults the parameter estimation for the method. Tests on real data (UCI and MIT-BIH database) have been performed and evaluated.
  • In present, data processing is an important process in many organizations. Classification trees are used to assign a classification to unknown data and can be also used for data partitioning (data clustering). The classification tree must be able to cope with outliers and have acceptably simple structure. An important advantage is the white-box structure. This paper presents a novel method called ACO-DTree for classification tree generation and their evolution inspired by natural processes. It uses a hybrid metaheuristics combining evolutionary strategies and ant colony optimization. Proposed method benefits from the stochastic process and population approach, which allows the algorithm to evolve more efficiently than the methods alone. The paper also consults the parameter estimation for the method. Tests on real data (UCI and MIT-BIH database) have been performed and evaluated. (en)
Title
  • Automated Classification Tree Evolution through Hybrid Metaheuristics
  • Automatizovaný vývoj klasifikačních stromů s využitím hybridní metaheuristiky (cs)
  • Automated Classification Tree Evolution through Hybrid Metaheuristics (en)
skos:prefLabel
  • Automated Classification Tree Evolution through Hybrid Metaheuristics
  • Automatizovaný vývoj klasifikačních stromů s využitím hybridní metaheuristiky (cs)
  • Automated Classification Tree Evolution through Hybrid Metaheuristics (en)
skos:notation
  • RIV/68407700:21230/07:03133990!RIV08-MSM-21230___
http://linked.open.../vavai/riv/strany
  • 191;198
http://linked.open...avai/riv/aktivita
http://linked.open...avai/riv/aktivity
  • Z(MSM6840770012)
http://linked.open...vai/riv/dodaniDat
http://linked.open...aciTvurceVysledku
http://linked.open.../riv/druhVysledku
http://linked.open...iv/duvernostUdaju
http://linked.open...titaPredkladatele
http://linked.open...dnocenehoVysledku
  • 411106
http://linked.open...ai/riv/idVysledku
  • RIV/68407700:21230/07:03133990
http://linked.open...riv/jazykVysledku
http://linked.open.../riv/klicovaSlova
  • ant colony optimization; artificial intelligence; classification tree; evolutionary algorithm; metaheuristics (en)
http://linked.open.../riv/klicoveSlovo
http://linked.open...ontrolniKodProRIV
  • [1A5EED09B620]
http://linked.open...v/mistoKonaniAkce
  • Salamanca
http://linked.open...i/riv/mistoVydani
  • Heidelberg
http://linked.open...i/riv/nazevZdroje
  • Innovations in Hybrid Intelligent Systems
http://linked.open...in/vavai/riv/obor
http://linked.open...ichTvurcuVysledku
http://linked.open...cetTvurcuVysledku
http://linked.open...UplatneniVysledku
http://linked.open...iv/tvurceVysledku
  • Burša, Miroslav
  • Lhotská, Lenka
http://linked.open...vavai/riv/typAkce
http://linked.open.../riv/zahajeniAkce
http://linked.open...n/vavai/riv/zamer
number of pages
http://purl.org/ne...btex#hasPublisher
  • Springer-Verlag
https://schema.org/isbn
  • 978-3-540-74971-4
http://localhost/t...ganizacniJednotka
  • 21230
Faceted Search & Find service v1.16.118 as of Jun 21 2024


Alternative Linked Data Documents: ODE     Content Formats:   [cxml] [csv]     RDF   [text] [turtle] [ld+json] [rdf+json] [rdf+xml]     ODATA   [atom+xml] [odata+json]     Microdata   [microdata+json] [html]    About   
This material is Open Knowledge   W3C Semantic Web Technology [RDF Data] Valid XHTML + RDFa
OpenLink Virtuoso version 07.20.3240 as of Jun 21 2024, on Linux (x86_64-pc-linux-gnu), Single-Server Edition (126 GB total memory, 67 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2024 OpenLink Software