scispace - formally typeset
Book ChapterDOI

A Review on Methods for Query Personalization

Shivangi Sharma, +1 more
- pp 1099-1106
TLDR
Time line of effective algorithms, which personalizes the query using some clustering methods, are explained, which can understand how the clusters methods improved toward user personalization.
Abstract
Partitioning a set of data (or objects) into a set of meaningful subclasses called clusters is clustering. This paper explains time line of effective algorithms, which personalizes the query using some clustering methods. The methods discussed are as follows: biclique clustering method, concept-based clustering method, personalized concept-based clustering method, content-based query clustering method, k-means clustering method for OLAP queries, personalization based on user preferences, rank-based Web search personalization and agent-based Web search personalization. Personalization has been taken into account in many fields such as data mining, Web search, making the users’ preferences available to them effectively. We can understand how the clustering methods improved toward user personalization. Adding few more attributes such as users, queries, and concepts shall improve personalization of search queries.

read more

References
More filters
Proceedings Article

A density-based algorithm for discovering clusters a density-based algorithm for discovering clusters in large spatial databases with noise

TL;DR: In this paper, a density-based notion of clusters is proposed to discover clusters of arbitrary shape, which can be used for class identification in large spatial databases and is shown to be more efficient than the well-known algorithm CLAR-ANS.
Proceedings Article

A density-based algorithm for discovering clusters in large spatial Databases with Noise

TL;DR: DBSCAN, a new clustering algorithm relying on a density-based notion of clusters which is designed to discover clusters of arbitrary shape, is presented which requires only one input parameter and supports the user in determining an appropriate value for it.
Book

The Grid 2: Blueprint for a New Computing Infrastructure

TL;DR: The Globus Toolkit as discussed by the authors is a toolkit for high-throughput resource management for distributed supercomputing applications, focusing on real-time wide-distributed instrumentation systems.
Journal ArticleDOI

The GRID: Blueprint for a New Computing Infrastructure

TL;DR: The main purpose is to update the designers and users of parallel numerical algorithms with the latest research in the field and present the novel ideas, results and work in progress and advancing state-of-the-art techniques in the area of parallel and distributed computing for numerical and computational optimization problems in scientific and engineering application.
Book ChapterDOI

New Algorithms for Enumerating All Maximal Cliques

TL;DR: This paper considers the problems of generating all maximal (bipartite) cliques in a given graph G=(V,E) with n vertices and m edges and proposes two algorithms for enumerating all maximal cliques.
Related Papers (5)