Buscar
Mostrando ítems 1-10 de 146
Multi-relational algorithm for mining association rules in large databases
(2011-12-01)
Multi-relational data mining enables pattern mining from multiple tables. The existing multi-relational mining association rules algorithms are not able to process large volumes of data, because the amount of memory required ...
Reducing the number of canonical form tests for frequent subgraph mining
(Computación y Sistemas, 2011)
Reducing the Number of Canonical Form Tests for Frequent Subgraph Mining
(Revista Computación y Sistemas; Vol. 15 No. 2, 2011-12-13)
Abstract. Frequent connected subgraph (FCS) mining is an interesting problem with wide applications in real life. Most of the FCS mining algorithms have been focused on detecting duplicate candidates using canonical form ...
Multi-relational algorithm for mining association rules in large databases
(2011-12-01)
Multi-relational data mining enables pattern mining from multiple tables. The existing multi-relational mining association rules algorithms are not able to process large volumes of data, because the amount of memory required ...
Reducing the number of canonical form tests for frequent subgraph mining
(Computación y Sistemas, 2011)
Mining negative rules: a literature review focusing on performance
(Ieee, 2021-01-01)
Mining of frequent patterns and association rules is a Data Mining task that aims to determine consistent relationships among elements in a transaction database. Algorithms that consider the absence of elements perform the ...