liu.seSearch for publications in DiVA
Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • oxford
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
A Random Indexing Approach for Web User Clustering and Web Prefetching
Information Security Center, State Key Laboratory of Networking and Switching Technology, Beijing University of Posts and Telecommunications, China.
Linköping University, Department of Computer and Information Science, NLPLAB - Natural Language Processing Laboratory. Linköping University, The Institute of Technology.ORCID iD: 0000-0003-4899-588X
Information Security Center, State Key Laboratory of Networking and Switching Technology, Beijing University of Posts and Telecommunications, China.
Information Security Center, State Key Laboratory of Networking and Switching Technology, Beijing University of Posts and Telecommunications, China.
Show others and affiliations
2012 (English)In: New Frontiers in Applied Data Mining: PAKDD 2011 International Workshops, Shenzhen, China, May 24-27, 2011, Revised Selected Papers / [ed] Longbing Cao, Joshua Zhexue Huang, James Bailey, Yun Sing Koh, Jun Luo, Springer Berlin/Heidelberg, 2012, 40-52 p.Chapter in book (Refereed)
Abstract [en]

In this paper we present a novel technique to capture Web users’ behaviour based on their interest-oriented actions. In our approach we utilise the vector space model Random Indexing to identify the latent factors or hidden relationships among Web users’ navigational behaviour. Random Indexing is an incremental vector space technique that allows for continuous Web usage mining. User requests are modelled by Random Indexing for individual users’ navigational pattern clustering and common user profile creation. Clustering Web users’ access patterns may capture common user interests and, in turn, build user profiles for advanced Web applications, such as Web caching and prefetching. We present results from the Web user clustering approach through experiments on a real Web log file with promising results. We also apply our data to a prefetching task and compare that with previous approaches. The results show that Random Indexing provides more accurate prefetchings.

Place, publisher, year, edition, pages
Springer Berlin/Heidelberg, 2012. 40-52 p.
Series
Lecture Notes in Computer Science, ISSN 0302-9743 (print), 1611-3349 (online) ; 7104
Keyword [en]
Computer science, Database management, Data mining, Information storage and retrieval systems, Artificial intelligence, Optical pattern recognition, Optical pattern recognition, Pattern Recognition, Pattern Recognition
National Category
Computer Science
Identifiers
URN: urn:nbn:se:liu:diva-72860DOI: 10.1007/978-3-642-28320-8_4ISBN: 978-3-642-28319-2 (print)ISBN: e-978-3-642-28320-8 OAI: oai:DiVA.org:liu-72860DiVA: diva2:463376
Available from: 2011-12-09 Created: 2011-12-09 Last updated: 2014-12-15Bibliographically approved

Open Access in DiVA

No full text

Other links

Publisher's full textfind book at a swedish library/hitta boken i ett svenskt bibliotekfind book in another country/hitta boken i ett annat land

Authority records BETA

Jönsson, Arne

Search in DiVA

By author/editor
Jönsson, Arne
By organisation
NLPLAB - Natural Language Processing LaboratoryThe Institute of Technology
Computer Science

Search outside of DiVA

GoogleGoogle Scholar

doi
isbn
urn-nbn

Altmetric score

doi
isbn
urn-nbn
Total: 65 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • oxford
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf