论文部分内容阅读
In this letter, a real-time C-V (Characteristic-Vector) clustering algorithm is putforth to treat with vast action data which are dynamically collected from web site. The algo-rithm 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 ofMatching (VDM) plays a key role in the clustering algorithm, which determines the magnitude of
In this letter, a real-time CV (Characteristic-Vector) clustering algorithm is putforth to treat with vast action data which are dynamically collected from web site. The algo-rithm cites the concept of CV to denote characteristic, synchronously it employs two- value [0,1] input and self-definition vigilance parameter to design clustering-architecture. Vector Degree ofMatching (VDM) plays a key role in the clustering algorithm, which determines the magnitude of