Abstract
We present a partitioning method able to manage web log sessions. Sessions are assimilable to transactions, i.e., tuples of variable size of categorical data. We adapt the standard definition of mathematical distance used in the K-Means algorithm to represent transactions dissimilarity, and redefine the notion of cluster centroid. The cluster centroid is used as the representative of the common properties of cluster elements. We show that using our concept of cluster centroid together with Jaccard distance we obtain results that are comparable with standard approaches, but substantially improve their efficiency.