Clustering by usage: higher order co-occurrences of learning objects
Proceedings of the 2nd International Conference on Learning Analytics and Knowledge
| Hi-index | 0.00 |
In this paper, we present a novel method for clustering web objects. Most of existing methods aren’t sufficient to explore similar objects, because the basic data, which include attributes of objects, click-through data, and link data, are often sparse, scarce or difficult to obtain. In contrast, the information we exploit is transaction log, which is more common, denser as well as noisier. To reduce the influence of the noises, we calculate the similarity in two steps. Firstly, we use a basic similarity to discover objects’ neighbors. The objects are represented by vectors consisting of their neighbors. Secondly, the cosine similarity of the object vectors is calculated for clustering. Experiments on synthetic data show that our method is robust against noises. Using noisy data, we increase the precision by 10%. Finally, we show real clustering results based on a movie dataset and achieve the coverage of 76% and the precision of 60%.