Algorithm CFP-SFPwith parallel processing

• Autorzy: Kujawiak M.
• Języki publikacji: EN

Abstrakty

EN

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.

Słowa kluczowe

EN

association rules; data mining; web logs; a priori; a priori TID; a priori hybrid algorithm; FP-Tree

• Wydawca: Wydawnictwo Uniwersytetu Przyrodniczo-Humanistycznego w Siedlcach
• Czasopismo: Studia Informatica : systems and information technology
• Rocznik: 2008
• Tom: Vol. 1(10)
• Strony: 87--93
• Opis fizyczny: Bibliogr. 5 poz., tab., wykr.

Twórcy

autor

Kujawiak M.

• Institute of Computer Science, University of Podlasie, ul. Sienkiewicza 51, 08-110 Siedlce, Poland

Bibliografia

• [1] Agrawal R., Imielinski T., Swami A.N. "Mining Association Rules between Sets of Items in Large Databases." SIGMOD. June 1993, 22(2):207-16.
• [2] Agrawal R., Srikant R. "Fast Algorithms for Mining Association Rules", VLDB. Sep 12-15 1994, Chile, 487-99, ISBN 1-55860-153-8.
• [3] Mannila H., Toivonen H., Verkamo A.I. "Efficient algorithms for discovering association rules." AAAI Workshop on Knowledge Discovery in Databases (SIGKDD). July 1994, Seattle, 181-92.
• [4] Ezeife C.I., Su Y., Mining Incremental Association Rules with Generalized FP-tree, Proceedings of the Fifteenth Canadian Conference on Artificial Intelligence (AI 2002), Calgary, Canada (May 25-29, 2002), Lecture Notes in Computer Science (LNCS), Springer-Verlag, Berlin Heidelberg 2002.
• [5] Kujawiak M., Kłopotek M.A., Wykrywanie reguł związków w plikach Web Logów, Technologie przetwarzania danych, TPD 2007, September 2007, Wydawnictwo Politechnika Poznańska, ISBN 978-83-7143-349-8.