Optimal determination of user-oriented clusters

Vijay V. Raghavan, Jitender S. Deogun

Research output: Chapter in Book/Report/Conference proceedingConference contribution

12 Scopus citations

Abstract

User-oriented clustering schemes enable the classification of documents based upon the user perception of the similarity between documents, rather than on some similarity function presumed by the designer to represent the user criteria. In this paper, an enhancement of such a clustering scheme is presented. This is accomplished by the formulation of the user-oriented clustering as a function-optimization problem. The problem formulated is termed the Boundary Selection Problem (BSP). Heuristic approaches to solve the BSP are proposed and a preliminary for evaluation of these approaches is provided.

Original languageEnglish (US)
Title of host publicationProceedings of the 10th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval, SIGIR 1987
EditorsC.T. Yu, C. Van Rijsbergen
PublisherAssociation for Computing Machinery, Inc
Pages140-146
Number of pages7
ISBN (Electronic)0897912322, 9780897912327
DOIs
StatePublished - Nov 1 1987
Event10th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval, SIGIR 1987 - New Orleans, United States
Duration: Jun 3 1987Jun 5 1987

Publication series

NameProceedings of the 10th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval, SIGIR 1987

Other

Other10th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval, SIGIR 1987
CountryUnited States
CityNew Orleans
Period6/3/876/5/87

ASJC Scopus subject areas

  • Information Systems and Management
  • Computer Science Applications
  • Information Systems

Fingerprint Dive into the research topics of 'Optimal determination of user-oriented clusters'. Together they form a unique fingerprint.

Cite this