About: Exploration of Document Classification with Linked Data and pageRank

Facets (new session)
Description
Metadata
Settings
- owl:sameAs
- Inference Rule:

About: Exploration of Document Classification with Linked Data and pageRank 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)

Attributes	Values
rdf:type	skos:Concept http://linked.opendata.cz/ontology/domain/vavai/Vysledek
Description	In this article, we would like to present a new approach to classification using Linked Data and PageRank. Our research is focused on classification methods that are enhanced by semantic information. The semantic information can be obtained from ontology or from Linked Data. DBpedia was used as a source of Linked Data in our case. The feature selection method is semantically based so features can be recognized by non-professional users as they are in a human readable and understandable form. PageRank is used during the feature selection and generation phase for the expansion of basic features into more general representatives. This means that feature selection and PageRank processing is based on network relations obtained from Linked Data. The discovered features can be used by standard classification algorithms. We will present promising results that show the simple applicability of this approach to two different datasets. In this article, we would like to present a new approach to classification using Linked Data and PageRank. Our research is focused on classification methods that are enhanced by semantic information. The semantic information can be obtained from ontology or from Linked Data. DBpedia was used as a source of Linked Data in our case. The feature selection method is semantically based so features can be recognized by non-professional users as they are in a human readable and understandable form. PageRank is used during the feature selection and generation phase for the expansion of basic features into more general representatives. This means that feature selection and PageRank processing is based on network relations obtained from Linked Data. The discovered features can be used by standard classification algorithms. We will present promising results that show the simple applicability of this approach to two different datasets. (en)
Title	Exploration of Document Classification with Linked Data and pageRank Exploration of Document Classification with Linked Data and pageRank (en)
skos:prefLabel	Exploration of Document Classification with Linked Data and pageRank Exploration of Document Classification with Linked Data and pageRank (en)
skos:notation	RIV/49777513:23520/14:43919202!RIV15-GA0-23520___
http://linked.open...avai/riv/aktivita	P S
http://linked.open...avai/riv/aktivity	P(ED1.1.00/02.0090), P(GAP103/11/1489), S
http://linked.open...vai/riv/dodaniDat	2015
http://linked.open...aciTvurceVysledku	Ježek, Karel Dostal, Martin Nykl, Michal
http://linked.open.../riv/druhVysledku	D - Článek ve sborníku
http://linked.open...iv/duvernostUdaju	S - Úplné a pravdivé údaje nepodléhající ochraně podle zvláštních právních předpisů
http://linked.open...titaPredkladatele	Západočeská univerzita v Plzni / Fakulta aplikovaných věd
http://linked.open...dnocenehoVysledku	16088
http://linked.open...ai/riv/idVysledku	RIV/49777513:23520/14:43919202
http://linked.open...riv/jazykVysledku	eng - angličtina
http://linked.open.../riv/klicovaSlova	classification, Linked Data, PageRank, feature selection (en)
http://linked.open.../riv/klicoveSlovo	PageRank classification feature selection Linked Data
http://linked.open...ontrolniKodProRIV	[86C33C73CBE7]
http://linked.open...v/mistoKonaniAkce	Praha
http://linked.open...i/riv/mistoVydani	Cham
http://linked.open...i/riv/nazevZdroje	Intelligent Distributed Computing VII
http://linked.open...in/vavai/riv/obor	IN
http://linked.open...ichTvurcuVysledku	3 (xsd:int)
http://linked.open...cetTvurcuVysledku	3 (xsd:int)
http://linked.open...vavai/riv/projekt	Methods of development and verification of component-based applications using natural language specifications NTIS - New Technologies for Information Society
http://linked.open...UplatneniVysledku	2014
http://linked.open...iv/tvurceVysledku	Dostal, Martin Ježek, Karel Nykl, Michal
http://linked.open...vavai/riv/typAkce	WRD - Světová
http://linked.open.../riv/zahajeniAkce	2013-09-04 (xsd:date)
issn	1860-949X
number of pages	7 (xsd:int)
http://bibframe.org/vocab/doi	10.1007/978-3-319-01571-2_6
http://purl.org/ne...btex#hasPublisher	Springer-Verlag
https://schema.org/isbn	978-3-319-01570-5
http://localhost/t...ganizacniJednotka	23520

Faceted Search & Find service v1.16.118 as of Jun 21 2024

Alternative Linked Data Documents: ODE Content Formats:

RDF

ODATA

Microdata

About

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, 75 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2024 OpenLink Software