DSpace DSpace UPC
 Català   Castellano   English  

E-prints UPC >
Altres >
Enviament des de DRAC >

Empreu aquest identificador per citar o enllaçar aquest ítem: http://hdl.handle.net/2117/9034

Arxiu Descripció MidaFormat
icfca09.pdf189,5 kBAdobe PDFThumbnail
Veure/Obrir

Citació: Baixeries, Jaume [et al.]. Yet a Faster Algorithm for Building the Hasse Diagram of a Galois Lattice. A: The Seventh International Conference in Formal Concept Analysis 2009. "International Conference in Formal Concept Analysis". Darmstadt: Springer Verlag, 2009, p. 162-177.
Títol: Yet a Faster Algorithm for Building the Hasse Diagram of a Galois Lattice
Autor: Baixeries i Juvillà, Jaume Veure Producció científica UPC
Editorial: Springer Verlag
Data: 2009
Tipus de document: Conference report
Resum: Formal concept analysis (FCA) is increasingly applied to data mining problems, essentially as a formal framework for mining reduced representations (bases) of target pattern families. Yet most of the FCA-based miners, closed pattern miners, would only extract the patterns themselves out of a dataset, whereas the generality order among patterns would be required for many bases. As a contribution to the topic of the (precedence) order computation on top of the set of closed patterns, we present a novel method that borrows its overall incremental approach from two algorithms in the literature. The claimed innovation consists of splitting the update of the precedence links into a large number of lower-cover list computations (as opposed to a single uppercover list computation) that unfold simultaneously. The resulting method shows a good improvement with respect to its counterpart both on its theoretical complexity and on its practical performance. It is therefore a good starting point for the design of efficient and scalable precedence miners.
ISBN: 978-3-642-01814-5
URI: http://hdl.handle.net/2117/9034
Apareix a les col·leccions:LARCA - Laboratori d'Algorísmia Relacional, Complexitat i Aprenentatge. Ponències/Comunicacions de congressos
Departament de Ciències de la Computació. Ponències/Comunicacions de congressos
Altres. Enviament des de DRAC
Comparteix:


Stats Mostra les estadístiques d'aquest ítem

SFX Query

Aquest ítem (excepte textos i imatges no creats per l'autor) està subjecte a una llicència de Creative Commons Llicència Creative Commons
Creative Commons

 

Valid XHTML 1.0! Programari DSpace Copyright © 2002-2004 MIT and Hewlett-Packard Comentaris
Universitat Politècnica de Catalunya. Servei de Biblioteques, Publicacions i Arxius