User behaviour analysis based on traffic log in wireless networks can be beneficial to many fields in real life: not only for commercial purposes, but also for improving network service quality and social management. We cluster users into groups marked by the most frequently visited websites to find their preferences. In this paper, we propose a user behaviour model based on Topic Model from document classification problems. We use the logarithmic TF-IDF (term frequency - inverse document frequency) weighing to form a high-dimensional sparse feature matrix. Then we apply LSA (Latent semantic analysis) to deduce the latent topic distribution and generate a low-dimensional dense feature matrix. K-means++, which is a classic clustering algorithm, is then applied to the dense feature matrix and several interpretable user clusters are found. Moreover, by combining the clustering results with additional demographical information, including age, gender, and financial information, we are able to uncover more realistic implications from the clustering results.
With the rapid development of wireless networks, the potential of user behaviour analysis has brought up tremendous attention recently. The most common method for user clustering is by applying K-means on raw profile matrix. For example, the web browsing similarity among users of a university laboratory is examined using web log data in in @cite_4 . Besides, in @cite_2 , the authors evaluate the effectiveness of K-Means and spectral clustering and discuss the effect of the profile size to the clustering results. The authors in @cite_12 discuss this personalization problem from another perspective. They apply K-Means to construct user profiles using device-side traffic logs. The authors also point out that the extra information on gender may help with the problem in future work.
@cite_4 @cite_12 @cite_2
2115952768 2104837959 2065424480 2156151108
In this paper, we introduce and evaluate a framework for a user profile-based socializing application. We model the user profile as an unordered set composed of n keywords that represent users' preferences. We evaluate the effectiveness of two clustering algorithms, k-means and spectral clustering in the scope of social groups' assessment. Through experimental results we substantiate the applicability of spectral clustering in the examined service and we evaluate the impact of profile size in terms of the quality of partitions yielded by spectral clustering. The above are performed using case studies and scenarios developed in the context of 1ST project's MAGNET Beyond pilot services definition. In this paper, we present "k-means+ID3", a method to cascade k-means clustering and the ID3 decision tree learning methods for classifying anomalous and normal activities in a computer network, an active electronic circuit, and a mechanical mass-beam system. The k-means clustering method first partitions the training instances into k clusters using Euclidean distance similarity. On each cluster, representing a density region of normal or anomaly instances, we build an ID3 decision tree. The decision tree on each cluster refines the decision boundaries by learning the subgroups within the cluster. To obtain a final decision on classification, the decisions of the k-means and ID3 methods are combined using two rules: 1) the nearest-neighbor rule and 2) the nearest-consensus rule. We perform experiments on three data sets: 1) network anomaly data (NAD), 2) Duffing equation data (DED), and 3) mechanical system data (MSD), which contain measurements from three distinct application domains of computer networks, an electronic circuit implementing a forced Duffing equation, and a mechanical system, respectively. Results show that the detection accuracy of the k-means+ID3 method is as high as 96.24 percent at a false-positive-rate of 0.03 percent on NAD; the total accuracy is as high as 80.01 percent on MSD and 79.9 percent on DED We propose novel cooperative spectrum sensing (CSS) algorithms for cognitive radio (CR) networks based on machine learning techniques which are used for pattern classification. In this regard, unsupervised (e.g., K-means clustering and Gaussian mixture model (GMM)) and supervised (e.g., support vector machine (SVM) and weighted K-nearest-neighbor (KNN)) learning-based classification techniques are implemented for CSS. For a radio channel, the vector of the energy levels estimated at CR devices is treated as a feature vector and fed into a classifier to decide whether the channel is available or not. The classifier categorizes each feature vector into either of the two classes, namely, the "channel available class" and the "channel unavailable class". Prior to the online classification, the classifier needs to go through a training phase. For classification, the K-means clustering algorithm partitions the training feature vectors into K clusters, where each cluster corresponds to a combined state of primary users (PUs) and then the classifier determines the class the test energy vector belongs to. The GMM obtains a mixture of Gaussian density functions that well describes the training feature vectors. In the case of the SVM, the support vectors (i.e., a subset of training vectors which fully specify the decision function) are obtained by maximizing the margin between the separating hyperplane and the training feature vectors. Furthermore, the weighted KNN classification technique is proposed for CSS for which the weight of each feature vector is calculated by evaluating the area under the receiver operating characteristic (ROC) curve of that feature vector. The performance of each classification technique is quantified in terms of the average training time, the sample classification delay, and the ROC curve. Our comparative results clearly reveal that the proposed algorithms outperform the existing state-of-the-art CSS techniques. Mobile device can be used as a medium to send and receive the mobile internet content. However, there are several limitations using mobile internet. Content personalisation has been viewed as an important area when using mobile internet. In order for personalisation to be successful, understanding the user is important. In this paper, we explore the implementation of the user profile at client-side, which may be used whenever user connect to the mobile content provider. The client-side user profile can help to free the provider in performing analysis by using data mining technique at the mobile device. This research investigates the conceptual idea of using clustering and classification of user profile at the client-site mobile. In this paper, we applied K-means and compared several other classification algorithms like TwoStep, Kohenen and Anomaly to determine the boundaries of the important factors using information ranking separation.