Clients Purchasing Tendency Community Classification in E-Commerce Scenario: Multi-Feature Search for Densely Distributed Clients in Huge Network

WWe propose a scalable, multi-feature graph-based mining framework. It segments large populations of online users—such as those on digital commerce or social networking platforms—into well-defined communities. These communities reflect shared purchasing tendencies. The term “huge network search” in the title refers to conducting dense subgraph search on our constructed huge network. This network models the relations of massive-scale clients. Our approach captures and encodes user preferences (e.g., favored dress colors or styles). It extracts a broad range of behavioral features, including those from weakly supervised learning. A geometric feature selection process refines these attributes, ensuring that only the most informative factors are retained. This provides a precise depiction of each client's buying behavior. User preferences are modeled as probabilistic distributions across multiple latent topics. This allows us to project complex purchasing patterns into a structured, hidden feature space. From this space, we construct a similarity-driven huge network. This network maps the relational landscape of users with comparable tastes. A dedicated community search algorithm uncovers densely interconnected subgroups. These subgroups are termed purchasing tendency communities. They exhibit consistent preference profiles, such as a collective inclination toward bright, saturated tones versus subtle, muted color palettes. To further enhance the personalization experience, the framework incorporates a tailored recommendation engine. This engine ranks and suggests products—such as clothing items or color themes—based on each userąŕs affiliation with learned communities. This ensures that suggestions are contextually appropriate and finely attuned to the individual's behavioral signature. The method was validated on a real-world dataset of over one million users. It demonstrates the ability to reliably uncover distinct consumer communities and drive large-scale, individualized recommendation services. The results affirm the commercial and experiential value of the system. This positions it as a powerful tool for user-centric product personalization in dynamic online environments.

Authors

Institutions

Publication Details

Journal
IEEE Access
Published
2025-01-01
DOI
https://doi.org/10.1109/access.2025.3590976
Primary Topic
Spam and Phishing Detection
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Clients Purchasing Tendency Community Classification in E-Commerce Scenario: Multi-Feature Search for Densely Distributed Clients in Huge Network

Yi‐Wei Kao, Mingyuan Li, Yang Chunming
IEEE Access
Spam and Phishing Detection
article

Clients Purchasing Tendency Community Classification in E-Commerce Scenario: Multi-Feature Search for Densely Distributed Clients in Huge Network

Yi‐Wei Kao, Mingyuan Li, Yang Chunming
article en

Abstract

WWe propose a scalable, multi-feature graph-based mining framework. It segments large populations of online users—such as those on digital commerce or social networking platforms—into well-defined communities. These communities reflect shared purchasing tendencies. The term “huge network search” in the title refers to conducting dense subgraph search on our constructed huge network. This network models the relations of massive-scale clients. Our approach captures and encodes user preferences (e.g., favored dress colors or styles). It extracts a broad range of behavioral features, including those from weakly supervised learning. A geometric feature selection process refines these attributes, ensuring that only the most informative factors are retained. This provides a precise depiction of each client's buying behavior. User preferences are modeled as probabilistic distributions across multiple latent topics. This allows us to project complex purchasing patterns into a structured, hidden feature space. From this space, we construct a similarity-driven huge network. This network maps the relational landscape of users with comparable tastes. A dedicated community search algorithm uncovers densely interconnected subgroups. These subgroups are termed purchasing tendency communities. They exhibit consistent preference profiles, such as a collective inclination toward bright, saturated tones versus subtle, muted color palettes. To further enhance the personalization experience, the framework incorporates a tailored recommendation engine. This engine ranks and suggests products—such as clothing items or color themes—based on each userąŕs affiliation with learned communities. This ensures that suggestions are contextually appropriate and finely attuned to the individual's behavioral signature. The method was validated on a real-world dataset of over one million users. It demonstrates the ability to reliably uncover distinct consumer communities and drive large-scale, individualized recommendation services. The results affirm the commercial and experiential value of the system. This positions it as a powerful tool for user-centric product personalization in dynamic online environments.

IEEE AccessVol. 13
Guangxi University of Finance and Economics (CN), Ming Chuan University (TW), Dongguan University of Technology (CN)
Openalex Percentile: Top 74%
Spam and Phishing Detection
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.