The k-means range algorithm for personalized data clustering in e-commerce

DOI10.1016/J.EJOR.2005.04.011zbMATH Open1110.90054OpenAlexW2119165863MaRDI QIDQ857263FDOQ857263

Authors: Georgios P. Papamichail, Dimitrios P. Papamichail 

Publication date: 14 December 2006

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2005.04.011

Recommendations

• Improvement study and application based on \(k\)-means clustering algorithm
• An extended study of the K-means algorithm for data clustering and its applications
• The new \(k\)-windows algorithm for improving the \(k\)-means clustering algorithm
• Statistical considerations of the \(k\)-means algorithm
• An efficient enhanced \(k\)-means clustering algorithm

zbMATH Keywords

heuristicsdata clusteringrange searchdistributed consumer decision-makingpersonalized systems

Mathematics Subject Classification ID

Management decision making, including multiple objectives (90B50) Approximation methods and heuristics in mathematical programming (90C59)

Cites Work

• Finding Groups in Data
• Title not available (Why is that?)
• Title not available (Why is that?)
• K-Means-Type Algorithms: A Generalized Convergence Theorem and Characterization of Local Optimality
• New Data Structures for Orthogonal Range Queries

Cited In (4)

• Handling multicriteria preferences in cluster analysis
• Clustering for Item Delivery Using Rule-K-Means
• Recommendation generation using personalized weight of meta-paths in heterogeneous information networks
• Cluster analysis of a price index series based on the hierarchical division algorithm

Uses Software

• clusfind

This page was built for publication: The \(k\)-means range algorithm for personalized data clustering in e-commerce

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q857263)