About: Using frequent closed itemsets for data dimensionality reduction

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

About: Using frequent closed itemsets for data dimensionality reduction 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	We address important issues of dimensionality reduction of transactional data sets where the input data consists of lists of transactions, each of them being a finite set of items. The reduction consists in finding a small set of new items, so-called factor-items, which is considerably smaller than the original set of items while comprising full or nearly full information about the original items. Using this type of reduction, the original data set can be represented by a smaller transactional data set using factor-items instead of the original items, thus reducing its dimensionality. The procedure utilized in this paper is based on approximate Boolean matrix decomposition. In this paper, we focus on the role of frequent closed itemsets that can be used to determine factor-items. We present the factorization problem, its reduction to Boolean matrix decompositions, experiments with publicly available data sets, and an algorithm for computing decompositions. We address important issues of dimensionality reduction of transactional data sets where the input data consists of lists of transactions, each of them being a finite set of items. The reduction consists in finding a small set of new items, so-called factor-items, which is considerably smaller than the original set of items while comprising full or nearly full information about the original items. Using this type of reduction, the original data set can be represented by a smaller transactional data set using factor-items instead of the original items, thus reducing its dimensionality. The procedure utilized in this paper is based on approximate Boolean matrix decomposition. In this paper, we focus on the role of frequent closed itemsets that can be used to determine factor-items. We present the factorization problem, its reduction to Boolean matrix decompositions, experiments with publicly available data sets, and an algorithm for computing decompositions. (en)
Title	Using frequent closed itemsets for data dimensionality reduction Using frequent closed itemsets for data dimensionality reduction (en)
skos:prefLabel	Using frequent closed itemsets for data dimensionality reduction Using frequent closed itemsets for data dimensionality reduction (en)
skos:notation	RIV/61989592:15310/11:33119207!RIV12-GA0-15310___
http://linked.open...avai/predkladatel	Přírodovědecká fakulta
http://linked.open...avai/riv/aktivita	P
http://linked.open...avai/riv/aktivity	P(GAP202/10/0262)
http://linked.open...vai/riv/dodaniDat	2012
http://linked.open...aciTvurceVysledku	Outrata, Jan Vychodil, Vilém Krajča, Petr
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	Univerzita Palackého v Olomouci / Přírodovědecká fakulta
http://linked.open...dnocenehoVysledku	237336
http://linked.open...ai/riv/idVysledku	RIV/61989592:15310/11:33119207
http://linked.open...riv/jazykVysledku	eng - angličtina
http://linked.open.../riv/klicovaSlova	Boolean matrices; dimensionality reduction; set covering; frequent closed itemsets (en)
http://linked.open.../riv/klicoveSlovo	Boolean matrices frequent closed itemsets set covering dimensionality reduction
http://linked.open...ontrolniKodProRIV	[5C6C35EB48F4]
http://linked.open...v/mistoKonaniAkce	Vancouver, Canada
http://linked.open...i/riv/mistoVydani	Los Alamitos, California
http://linked.open...i/riv/nazevZdroje	Proceedings of the ICDM 2011, The 11th IEEE International Conference on Data Mining
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	Decompositions of matrices with binary and ordinal data: theory, algorithms, and complexity
http://linked.open...UplatneniVysledku	2011
http://linked.open...iv/tvurceVysledku	Outrata, Jan Vychodil, Vilém Krajča, Petr
http://linked.open...vavai/riv/typAkce	WRD - Světová
http://linked.open.../riv/zahajeniAkce	2011-12-11 (xsd:date)
number of pages	6 (xsd:int)
http://purl.org/ne...btex#hasPublisher	IEEE Computer Society, Conference Publishing Services, Los Alamitos, California
https://schema.org/isbn	978-0-7695-4408-3
http://localhost/t...ganizacniJednotka	15310
is http://linked.open...avai/riv/vysledek of	Using frequent closed itemsets for data dimensionality reduction Using frequent closed itemsets for data dimensionality reduction

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