• Aug 09, 2018 News! Vol. 6, No. 4-No. 7, No. 3 has been indexed by EI(Inspec)!   [Click]
  • Aug 09, 2018 News!Good News! All papers from Volume 8, Number 3 have been indexed by Scopus!   [Click]
  • May 23, 2018 News![CFP] 2018 the annual meeting of IJMLC Editorial Board, ACMLC 2018, will be held in Ho Chi Minh, Vietnam, December 7-9, 2018   [Click]
General Information
Dr. Lin Huang
Metropolitan State University of Denver, USA
It's my honor to take on the position of editor in chief of IJMLC. We encourage authors to submit papers concerning any branch of machine learning and computing.
IJMLC 2012 Vol.2(3): 219-221 ISSN: 2010-3700
DOI: 10.7763/IJMLC.2012.V2.117

Clustering Web Logs Using Similarity Upper Approximation with Different Similarity Measures

Rajhans Mishra and Pradeep Kumar

Abstract—In this paper we adopted the similarity upper approximation based clustering of web logs using various similarity/distance metrics. The paper shows the viability of our methodology. Web logs capture the information about web sites as well the sequence of the visit. Sequence of visit provides an important insight about the behavior of the user. Rough set, a soft computing technique, deals with vagueness present in data. It captures the indiscernibility at different levels of granularity. The paper has shown the results on msnbc data set with different similarity measures along with explanation of results.

Index Terms—Clustering, sequential data, similarity upper approximation.

Authors are with Information Technology & Systems Department, Indian Institute of Management Lucknow, IIM Lucknow Uttar Pradesh- India (e-mail: rajhans@ iiml.org; pradeepkumar@iiml.ac.in).


Cite: Rajhans Mishra and Pradeep Kumar, "Clustering Web Logs Using Similarity Upper Approximation with Different Similarity Measures," International Journal of Machine Learning and Computing vol. 2, no. 3, pp. 219-221, 2012.

Copyright © 2008-2018. International Journal of Machine Learning and Computing. All rights reserved.
E-mail: ijmlc@ejournal.net