Cited by 38Web Data Mining and AnalysisRecommender Systems and TechniquesAdvanced Clustering Algorithms Research

Discovering user communities on the Internet using unsupervised machine learning techniques

Paliouras, G, Papatheodorou, C, Karkaletsis, V, Spyropoulos, C.D·2002·Interacting with Computers

Abstract

Interest in the analysis of user behaviour on the Internet has been increasing rapidly, especially since the advent of electronic commerce. In this context, we argue here for the usefulness of constructing communities of users with common behaviour, making use of machine learning techniques. In particular, we assume that the users of any service on the Internet constitute a large community and we aim to construct smaller communities of users with common characteristics. The paper presents the results of three case studies for three different types of Internet service: a digital library, an information broker and a Web site. Particular attention is paid on the different types of information access involved in the three case studies: query-based information retrieval, profile-based information filtering and Web-site navigation. Each type of access imposes different constraints on the representation of the learning task. Two different unsupervised learning methods are evaluated: conceptual clustering and cluster mining. One of our main concerns is the construction of meaningful communities that can be used for improving information access on the Internet. Analysis of the results in the three case studies brings to surface some of the important properties of the task, suggesting the feasibility of a common methodology for the three different types of information access on the Internet.

Integrity signals

Registry

Crossref · 10.1016/s0953-5438(02)00015-2

Cites

43 of 43 references verified0 citation errors · 0 not checkable

Statistics

Recomputing p-values needs the paper’s full text.

Claims the paper makes

This paper’s full text isn’t openly available, so its claims and self-check weren’t run. The registry and citation checks still apply.

Claims other papers make about this one

Each is checked against this paper’s own text: does it say what the citing paper says it does?

Cites

Flagged first, then by citations

Cited by

Sorted by citations

Authors
Paliouras, G., Papatheodorou, C., Karkaletsis, V, & Spyropoulos, C. D.
Affiliations
  • Ionian University (GR)
  • National Centre of Scientific Research "Demokritos" (GR)
Venue
Interacting with Computers
Published
2002-12
Volume
14
Issue
6
Pages
761-791
ISSN
0953-5438 (ISSN-L)
OpenAlex
W2080578035
Cited by
38
References
43
Citations by year
2025: 1 · 2022: 4 · 2021: 4 · 2020: 1 · 2018: 1 · 2017: 3 · 2016: 3 · 2015: 1 · 2013: 1
FWCI
6.04
Type
journal article
Language
en
Open access
closed
Locations
Interacting with Computers (publishedVersion)
Topics
  • Physical Sciences › Computer Science › Information Systems › Web Data Mining and Analysis
  • Physical Sciences › Computer Science › Information Systems › Recommender Systems and Techniques
  • Physical Sciences › Computer Science › Artificial Intelligence › Advanced Clustering Algorithms Research
Keywords
user communities, user behavior analysis, unsupervised learning, conceptual clustering, information filtering, digital libraries, information brokers, web navigation, e-commerce, access to information

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review