Self-organization and associative memory: 3rd edition
Self-organization and associative memory: 3rd edition
Rough Sets: Theoretical Aspects of Reasoning about Data
Rough Sets: Theoretical Aspects of Reasoning about Data
Pattern Recognition with Fuzzy Objective Function Algorithms
Pattern Recognition with Fuzzy Objective Function Algorithms
Interval Set Clustering of Web Users with Rough K-Means
Journal of Intelligent Information Systems
Some new indexes of cluster validity
IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics
Hi-index | 0.00 |
Internet is a rich and potential information base. It needs scientific and effective methods in order to find interesting information. Researchers have proposed many web clustering algorithms, but it spends too much time using a simple kind of clustering algorithms, because the number of the web information is huge. Considering the efficiency and the effect of the clustering, in the paper, we use a two-layer web clustering approach to cluster for a number of web access patterns from web logs. At the first layer, we use the LVQ (Learning Vector Quantization) neural network to group the web access patterns to several representative clustering centers. At the second layer, the rough k-means algorithm is adopted to deal with the result of the first layer, producing the final classifications. The experimental results show that the effect is close to monolayer clustering algorithm the rough k-means, and the efficiency is better than the rough k-means by using the two-layer web clustering approach.