Novel Modified Fuzzy Possibilistic C Means (FPCM) for Web Log Mining by Removing Global Noise and Web Robots

Author:

Palani Sami Nithya1,Palani Aban Sumathi2

Affiliation:

1. Department of Computer Science, Manonmanaiam Sundaranar University, Tirunelveli, India

2. Research Department of Computer Science, Government Arts College, Coimbatore, Tamilnadu, India

Abstract

Nowadays, internet is a useful source of information in everyone’s daily activity. Hence, this made a huge development of world wide web in its quantity of interchange and its size and difficulty of websites. Web Usage Mining WUM is one of the main applications of data mining, artificial intelligence and so on to the web data and forecast the user’s visiting behaviors and obtains their interests by investigating the samples. SinceWUM directly involves in large range of applications, such as, e-commerce, e-learning, Web analytics, information retrieval etc. Web log data is one of the major sources which contain all the information regarding the users visited links, browsing patterns, time spent on a particular page or link and this information can be used in several applications like adaptive web sites, modified services, customer summary, pre-fetching, generate attractive web sites etc. There are varieties of problems related with the existing web usage mining approaches. Existing web usage mining algorithms suffer from difficulty of practical applicability. So, a novel research is very much necessary for the accurate prediction of future performance of web users with rapid execution time. The main aim of this paper to remove the noise and web robots by novel approach and provide faster and easier data processing and it also helps in saving time and it resource. In this paper, a novel pre-processing technique is proposed by removing local and global noise and web robots. Anonymous Microsoft Web Dataset and MSNBC.com Anonymous Web Dataset are used for evaluating the proposed preprocessing technique. An Effective Web User Analysis and Clustering are analyzed using Modified Fuzzy Possibilistic C Means (FPCM). Then results are evaluated using Hit Rate and Execution time.

Publisher

Emerald

Subject

General Medicine

Reference23 articles.

1. Aghabozorgi SR (2009) Using Incremental Fuzzy Clustering to Web Usage Mining. In: Wah TY(eds), SOCPAR’09 Proceedings of the 2009 International Conference of Soft Computing and Pattern Recognition, IEEE Computer Society Washington, DC, USA, pp653-658. Available at: http://www.dl.acm.org/citation.cfm?id=1685695

2. Baraglia R (2002) SUGGEST: a Web usage Mining System. In: Palmerini P (eds), Proceedings of International Conference on Informa- April 2002, Las Vegas, NV, USA, pp 282-287. Available at: https://www.ieeexplore.ieee.org/xpl/mostRecentIssue.jsp?punumber=7847

3. Bezdek J (1981) Pattern Recognition with Fuzzy Objective Function Algorithms: Advanced Applications In Pattern Recognition. Plenum Press. New York USA & London, UK, pp1-253. Available at: http://www.download.springer.com/static/pdf/518/bfm%253A978-1-4757-0450-1%252F1.pdf?auth66=1395160039_62369c3cda1ecc2046d8840135551a5f&ext=.pdf

4. Chih-Hung Wu (2010) Web Usage Mining on the Sequences of Clicking Patterns in a Grid Computing Environment. In: Yen-Liang Wu; Yuan-Ming Chang; and Ming-Hung Hung (eds), Proceedings of International Conference on Machine Learning and Cybernetics (ICMLC) 11-14 July 2010, Qingdao, China, vol. 6, pp2909-2914. Available at: http://www.ieeexplore.ieee.org/xpl/login.jsp?tp=&arnumber=5580751

5. Chu-Hui Lee (2008) Web Usage Mining Based on Clustering of Browsing Features. In: Yu-Hsiang Fu (eds) Proceedings of the 8th International Conference on Intelligent Systems Design and Applications, 26-28 Nov. 2008, Kaohsiung, Taiwan, vol. 1, pp281-286. Available at: http://www.ieeexplore.ieee.org/xpl/login.jsp?tp=&arnumber=4696217

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3