Találati lista | Tudóstér

001-es BibID:	BIBFORM087372
Első szerző:	Nagy Benedek (informatikus, matematikus)
Cím:	Cellular topology and topological coordinate systems on the hexagonal and on the triangular grids / Benedek Nagy
Dátum:	2015
ISSN:	1012-2443 1573-7470
Megjegyzések:	In this paper we use symmetric coordinate systems for the hexagonal and the triangular grids (that are dual of each other). We present new coordinate systems by extending the symmetric coordinate systems that are appropriate to address elements (cells) of cell complexes. Coordinate triplets are used to address the hexagon/triangle pixels, their sides (the edges between the border of neighbour pixels) and the points at the corners of the hexagon/triangle pixels. Properties of the coordinate systems are detailed, lines (zig-zag lines) and lanes (hexagonal stepping lanes) are defined on the triangular (resp. hexagonal) grid by fixing a coordinate value. The bounding relation of the cells can easily be captured by the coordinate values. To illustrate the utility of these coordinate systems some topological algorithms, namely collapses and cuts are presented.
Tárgyszavak:	Műszaki tudományok Informatikai tudományok idegen nyelvű folyóiratközlemény külföldi lapban folyóiratcikk
Megjelenés:	Annals of Mathematics and Artificial Intelligence. - 75 : 1-2 (2015), p. 117-134. -
Pályázati támogatás:	TÁMOP-4.2.2/C-11/1/KONV-2012-0001 TÁMOP
Internet cím:	Szerző által megadott URL DOI Intézményi repozitóriumban (DEA) tárolt változat
Borító:
Saját polcon:

001-es BibID:	BIBFORM087373
Első szerző:	Szathmáry László (programtervező-informatikus)
Cím:	A fast compound algorithm for mining generators, closed itemsets, and computing links between equivalence classes / Laszlo Szathmary, Petko Valtchev, Amedeo Napoli, Robert Godin, Alix Boc, Vladimir Makarenkov
Dátum:	2013
ISSN:	1012-2443 1573-7470
Megjegyzések:	In pattern mining and association rule mining, there is a variety of algorithms for mining frequent closed itemsets (FCIs) and frequent generators (FGs), whereas a smaller part further involves the precedence relation between FCIs. The interplay of these three constructs and their joint computation have been studied within the formal concept analysis (FCA) field yet none of the proposed algorithms is scalable. In frequent pattern mining, at least one suite of efficient algorithms has been designed that exploits basically the same ideas and follows the same overall computational schema. Based on an in-depth analysis of the aforementioned interplay that is rooted in a fundamental duality from hypergraph theory, we propose a new schema that should enable for a more parsimonious computation. We exemplify the new schema in the design of Snow-Touch, a concrete FCI/FG/precedence miner that reuses an existing algorithm, Charm, for mining FCIs, and completes it with two original methods for mining FGs and precedence, respectively. The performance of Snow-Touch and of its closest competitor, Charm-L, were experimentally compared using a large variety of datasets. The outcome of the experimental study suggests that our method outperforms Charm-L on dense data while on sparse one the trend is reversed. Furthermore, we demonstrate the usefulness of our method and the new schema through an application to the analysis of a genome dataset. The initial results reported here confirm the capacity of the method to focus on significant associations.
Tárgyszavak:	Műszaki tudományok Informatikai tudományok idegen nyelvű folyóiratközlemény külföldi lapban folyóiratcikk
Megjelenés:	Annals of Mathematics and Artificial Intelligence. - 70 : 1-2 (2013), p. 81-105. -
További szerzők:	Valtchev, Petko Napoli, Amedeo Godin, Robert Boc, Alix Makarenkov, Vladimir
Internet cím:	Szerző által megadott URL DOI Intézményi repozitóriumban (DEA) tárolt változat
Borító:
Saját polcon: