International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
|
Volume 49 - Issue 10 |
Published: July 2012 |
Authors: Shyam Sundar Meena |
![]() |
Shyam Sundar Meena . Efficient Discovery of Frequent Patterns using KFP-Tree from Web Logs. International Journal of Computer Applications. 49, 10 (July 2012), 15-18. DOI=10.5120/7662-0770
@article{ 10.5120/7662-0770, author = { Shyam Sundar Meena }, title = { Efficient Discovery of Frequent Patterns using KFP-Tree from Web Logs }, journal = { International Journal of Computer Applications }, year = { 2012 }, volume = { 49 }, number = { 10 }, pages = { 15-18 }, doi = { 10.5120/7662-0770 }, publisher = { Foundation of Computer Science (FCS), NY, USA } }
%0 Journal Article %D 2012 %A Shyam Sundar Meena %T Efficient Discovery of Frequent Patterns using KFP-Tree from Web Logs%T %J International Journal of Computer Applications %V 49 %N 10 %P 15-18 %R 10.5120/7662-0770 %I Foundation of Computer Science (FCS), NY, USA
Frequent pattern discovery is a heavily focused area in data mining. Discovering concealed information from Web log data is called Web usage mining. Web usage mining discovers interesting and frequent user access patterns from web logs. This paper contains a novel approach, based on k-mean and frequent pattern tree (FP-tree), for frequent pattern mining from Weblog data.