2026-10-17T13:09:33Z https://meral.edu.mm/oai

oai:meral.edu.mm:recid/5063 2022-03-24T23:16:32Z 1582963302567:1597824273898 user-ucsy

Enhanced Matrix based Frequent Accessed Pages Mining Algorithm Aung, Tharyar Tun, Khin Nwe Ni In computer science and Web miningwhich is an interdisciplinary subfield of computerscience, is the computational process ofdiscovering patterns in web log files. The overallgoal of the web mining process is to extractinformation from web log files and transform itinto an understandable structure for further use.In Web mining, Apriori is a classic algorithm forlearning association rules. This classicalalgorithm is inefficient due to so many scans ofdatabase and takes too much time to scan thedatabase. In this paper we will build a method toobtain the frequent page-item set by using adifferent approach to the classical Apriorialgorithm but based on it and applying theconcept of transaction reduction and a new matrixmethod. 2017-12-27 http://hdl.handle.net/20.500.12678/0000005063 https://meral.edu.mm/records/5063