Temat: algorithm a priori - Katalog OPAC zbiorów

Skocz do pozycji: 1.

Tytuł:: Algorithm CFP-SFPwith parallel processing
Autorzy:: Kujawiak, M.
Powiązania:: https://bibliotekanauki.pl/articles/92930.pdf
Data publikacji:: 2008
Wydawca:: Uniwersytet Przyrodniczo-Humanistyczny w Siedlcach
Tematy:: association rules
data mining
web logs
a priori
a priori TID
a priori hybrid algorithm
FP-Tree
Opis:: Existing algorithms for finding association rules do not implement parallel processing. This paper proposes CFP-SFP (Creating Frequent Patterns with Set from Frequent Patterns) algorithm with parallel processing. The research involves running CEP-SEP algorithm with one thread and a dozen or so threads that are executed simultaneously. The research was conducted on a computer with one processor and dual-core processor.
Źródło:: Studia Informatica : systems and information technology; 2008, 1(10); 87-93
1731-2264
Pojawia się w:: Studia Informatica : systems and information technology
Dostawca treści:: Biblioteka Nauki

Artykuł

Skocz do pozycji: 2.

Tytuł:: Minimal Decision Rules Based on the Apriori Algorithm
Autorzy:: Fernandez, M. C.
Menasalvas, E.
Marban, O.
Pena, J. M.
Millan, S.
Powiązania:: https://bibliotekanauki.pl/articles/908364.pdf
Data publikacji:: 2001
Wydawca:: Uniwersytet Zielonogórski. Oficyna Wydawnicza
Tematy:: baza danych
algorytmy
rough sets
rough dependencies
association rules
a priori algorithm
minimal decision rules
Opis:: Based on rough set theory many algorithms for rules extraction from data have been proposed. Decision rules can be obtained directly from a database. Some condition values may be unnecessary in a decision rule produced directly from the database. Such values can then be eliminated to create a more comprehensible (minimal) rule. Most of the algorithms that have been proposed to calculate minimal rules are based on rough set theory or machine learning. In our approach, in a post-processing stage, we apply the Apriori algorithm to reduce the decision rules obtained through rough sets. The set of dependencies thus obtained will help us discover irrelevant attribute values.
Źródło:: International Journal of Applied Mathematics and Computer Science; 2001, 11, 3; 691-704
1641-876X
2083-8492
Pojawia się w:: International Journal of Applied Mathematics and Computer Science
Dostawca treści:: Biblioteka Nauki

Artykuł

Skocz do pozycji: 3.

Tytuł:: Application of data mining techniques to find relationships between the dishes offered by a restaurant for the elaboration of combos based on the preferences of the diners
Autorzy:: Vazquez, Rosa Maria
Bonilla, Edmundo
Sanchez, Eduardo
Atriano, Oscar
Berruecos, Cinthya
Powiązania:: https://bibliotekanauki.pl/articles/118001.pdf
Data publikacji:: 2019
Wydawca:: Polskie Towarzystwo Promocji Wiedzy
Tematy:: data mining
association rules
apriori algorithm
combos
Web Service
eksploracja danych
reguły asocjacji
algorytm a priori
kombinacje
Opis:: Currently, blended food has been a common menu item in fast food restaurants. The sales of the fast-food industry grow thanks to several sales strategies, including the “combos”, so, specialty, regional, family and buffet restaurants are even joining combos’ promotions. This research paper presents the implementation of a system that will serve as support to elaborate combos according to the preferences of the diners using data mining techniques to find relationships between the different dishes that are offered in a restaurant. The software resulting from this research is being used by the mobile application Food Express, with which it communicates through webservices. References
Źródło:: Applied Computer Science; 2019, 15, 2; 73-88
1895-3735
Pojawia się w:: Applied Computer Science
Dostawca treści:: Biblioteka Nauki

Artykuł

Informacja