About: Simplified Progressive Data Mining     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
  • There are huge amounts of data stored in databases, but it is very difficult to make decisions based on this data. We propose the OLAM SE system (Self Explaining On-Line Analytical Mining) that is similar to the Han's OLAM [5] in the idea of interactive data mining. The contribution is to simplify on-line analytical data mining to professionals, who understand their data but want more significant, interesting and useful information. It is done by shielding internal concepts (associations, classifications, characterizations) and thresholds (supports, confidences) from the user and by a simple graphical interface that suggests most relevant items. OLAM SE determines minimum support value from required cover of data with usage of entropy coding principle. This is automatically applied on the structure based on given conceptual hierarchy where present. We also determine the maximum threshold to avoid explaining knowledge that is obvious. Major part of data is thus described by frequent patterns. The prese
  • There are huge amounts of data stored in databases, but it is very difficult to make decisions based on this data. We propose the OLAM SE system (Self Explaining On-Line Analytical Mining) that is similar to the Han's OLAM [5] in the idea of interactive data mining. The contribution is to simplify on-line analytical data mining to professionals, who understand their data but want more significant, interesting and useful information. It is done by shielding internal concepts (associations, classifications, characterizations) and thresholds (supports, confidences) from the user and by a simple graphical interface that suggests most relevant items. OLAM SE determines minimum support value from required cover of data with usage of entropy coding principle. This is automatically applied on the structure based on given conceptual hierarchy where present. We also determine the maximum threshold to avoid explaining knowledge that is obvious. Major part of data is thus described by frequent patterns. The prese (en)
  • Existuje velké množstí dat uložených v databázích, ale je velmi obtížné provádět na jejich základě relevantní rozhodnutí. Představujeme systém OLAM SE (Self Explaining On-Line Analytical Mining). Účelem je zjednodušit on-line analytické dololování pro profesionály, kteří provádějí rozhodnutí... (cs)
Title
  • Simplified Progressive Data Mining
  • Simplified Progressive Data Mining (en)
  • Zjednodušené progresivní dolování dat (cs)
skos:prefLabel
  • Simplified Progressive Data Mining
  • Simplified Progressive Data Mining (en)
  • Zjednodušené progresivní dolování dat (cs)
skos:notation
  • RIV/00216305:26230/07:PU73636!RIV08-MSM-26230___
http://linked.open.../vavai/riv/strany
  • 1-10
http://linked.open...avai/riv/aktivita
http://linked.open...avai/riv/aktivity
  • Z(MSM0021630528)
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
  • 449829
http://linked.open...ai/riv/idVysledku
  • RIV/00216305:26230/07:PU73636
http://linked.open...riv/jazykVysledku
http://linked.open.../riv/klicovaSlova
  • On-line data mining, concept hierarchy, frequent patterns, cover, obviosity (en)
http://linked.open.../riv/klicoveSlovo
http://linked.open...ontrolniKodProRIV
  • [B6418B0F0FD6]
http://linked.open...v/mistoKonaniAkce
  • Wroclaw
http://linked.open...i/riv/mistoVydani
  • Wroclaw
http://linked.open...i/riv/nazevZdroje
  • Proceedings of the 16th International Conference on Systems Science
http://linked.open...in/vavai/riv/obor
http://linked.open...ichTvurcuVysledku
http://linked.open...cetTvurcuVysledku
http://linked.open...UplatneniVysledku
http://linked.open...iv/tvurceVysledku
  • Chmelař, Petr
  • Stryka, Lukáš
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
  • Politechnika Wrocławska
https://schema.org/isbn
  • 978-83-7493-340-7
http://localhost/t...ganizacniJednotka
  • 26230
is http://linked.open...avai/riv/vysledek of
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, 58 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2024 OpenLink Software