Web Proxy Log Data Mining System for Clustering Users and Search Keywords

T. Bilgin, M. Aytekin
{"title":"Web Proxy Log Data Mining System for Clustering Users and Search Keywords","authors":"T. Bilgin, M. Aytekin","doi":"10.18466/cbayarfbe.330088","DOIUrl":null,"url":null,"abstract":"In this study, Internet users were clustered by the search keywords which they type into search bars of search engines. Our proposed software is called UQCS (User Queries Clustering System) and it was developed to demonstrate the efficiency of our hypothesis. UQCS co-operates with the Strehl’s relationship based clustering toolkit and performs segmentation on users based on the keywords they use for searching the web. Internet Proxy server logs were parsed and query strings were extracted from the search engine URL’s and the resulting IP-Term matrix was converted into a similarity matrix using Euclidean, Jaccard, Cosine Distance and Pearson Correlation Distance metrics. K- Means and graph-based OPOSSUM algorithm were used to perform clustering on the similarity matrices.  Results were illustrated by using CLUSION visualization toolkit.","PeriodicalId":9652,"journal":{"name":"Celal Bayar Universitesi Fen Bilimleri Dergisi","volume":"344 1","pages":"873-881"},"PeriodicalIF":0.0000,"publicationDate":"2017-12-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Celal Bayar Universitesi Fen Bilimleri Dergisi","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.18466/cbayarfbe.330088","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

In this study, Internet users were clustered by the search keywords which they type into search bars of search engines. Our proposed software is called UQCS (User Queries Clustering System) and it was developed to demonstrate the efficiency of our hypothesis. UQCS co-operates with the Strehl’s relationship based clustering toolkit and performs segmentation on users based on the keywords they use for searching the web. Internet Proxy server logs were parsed and query strings were extracted from the search engine URL’s and the resulting IP-Term matrix was converted into a similarity matrix using Euclidean, Jaccard, Cosine Distance and Pearson Correlation Distance metrics. K- Means and graph-based OPOSSUM algorithm were used to perform clustering on the similarity matrices.  Results were illustrated by using CLUSION visualization toolkit.
面向用户聚类和关键词搜索的Web代理日志数据挖掘系统
在本研究中,互联网用户被聚集在搜索引擎的搜索栏输入的搜索关键词。我们提出的软件被称为UQCS(用户查询聚类系统),它的开发是为了证明我们假设的有效性。UQCS与基于Strehl关系的聚类工具包合作,根据用户搜索web时使用的关键字对用户进行细分。通过解析互联网代理服务器日志,从搜索引擎URL中提取查询字符串,并使用欧几里得、Jaccard、余弦距离和Pearson相关距离度量将结果IP-Term矩阵转换为相似矩阵。采用K- Means算法和基于图的OPOSSUM算法对相似矩阵进行聚类。使用CLUSION可视化工具对结果进行说明。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信