A REAL—TIME C—V CLUSTERING ALGORITHM FOR WEB—MINING

In this letter, a real-time C-V (Characteristic-Vector) clustering algorithm is put forth to treat with vast action data which are dynamically collected from web site.The algo-fithm cites the concept of C-V to denote characteristic, synchronously it adopts two-value[0,1] input and self-definition vi...

Full description

Saved in:
Bibliographic Details
Published in:Journal of electronics (China) 2002, Vol.19 (1), p.71-75
Main Authors: Li, Haiying, Zhuang, Zhenquan, Li, Bin, Wan, Ke
Format: Article
Language:English
Subjects:
VDM
WEB数据挖掘
向量匹配度
特征向量
聚类算法
Citations: Items that this one cites
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:In this letter, a real-time C-V (Characteristic-Vector) clustering algorithm is put forth to treat with vast action data which are dynamically collected from web site.The algo-fithm cites the concept of C-V to denote characteristic, synchronously it adopts two-value[0,1] input and self-definition vigilance parameter to design clustering-architecture.Vector Degree of Matching(VDM) plays a key role in the clustering algorithm, which determines the magnitude of typical characteristic.Making use of stability analysis, the classifications are confirmed to have reliably hierarchical structure when vigilance parameter shifts from 0.1 to 0.99.This non-linear relation between vigilance parameter and classification upper limit helps mining out representa-tive classifications from net-users according to the actural web resource, then administering system can map them to web resource space to implement the intelligent configuration effectually and reapidly.
ISSN:0217-9822
1993-0615
DOI:10.1007/s11767-002-0012-4