Carregant...
Carregant...

Vés al contingut (premeu Retorn)

Mining frequent closed rooted trees

Autor
Balcazar, J. L.; Bifet, A.C.; Lozano, A.
Tipus d'activitat
Article en revista
Revista
Machine learning
Data de publicació
2010-01
Volum
78
Número
1-2
Pàgina inicial
1
Pàgina final
33
DOI
https://doi.org/10.1007/s10994-009-5123-9 Obrir en finestra nova
Repositori
http://hdl.handle.net/2117/6835 Obrir en finestra nova
URL
http://www.lsi.upc.edu/~abifet/MLMLG07BBL.pdf Obrir en finestra nova
Resum
Many knowledge representation mechanisms are based on tree-like structures, thus symbolizing the fact that certain pieces of information are related in one sense or another. There exists a well-studied process of closure-based data mining in the itemset framework: we consider the extension of this process into trees. We focus mostly on the case where labels on the nodes are nonexistent or unreliable, and discuss algorithms for closurebased mining that only rely on the root of the tree and the li...
Citació
Balcazar, J.; Bifet, A.; Lozano, A. Mining frequent closed rooted trees. "Machine learning", Gener 2010, vol. 78, núm. 1-2, p. 1-33.
Grup de recerca
LARCA - Laboratori d'Algorísmia Relacional, Complexitat i Aprenentatge
LOGPROG - Lògica i Programació

Participants

Arxius