Jue Wang
ABSTRACT
In recent years, some of the methods based on the deep learning theory to identify human activities have been proposed. However, most of these methods are not suitable for hardware with limited resources when it comes to rapid real-time analysis considering its analysis complexity and data scale. In order to minimize the amount of input data, a variety of clustering analysis methods are proposed to address this issue. Six clustering algorithms including K-means clustering algorithm, K-mode clustering algorithm, CLARANS clustering algorithm, BIRCH clustering algorithm and DBSCAN clustering algorithm are implemented to reduce the feature scale, results in greatly reduced amount of input data while a high recognition accuracy is still ensured. When the DBSCAN clustering algorithm is used to reduce the feature dimension from 561 to 145, the classification accuracy drops merely less than 2%, reaching 93.58%. Even when the number of features is reduced to 100, the accuracy can still be maintained at 91.38%. By using Birch clustering algorithm, CLARANS clustering algorithm and K-mode clustering algorithm, the classification accuracy is 89.75%, 85.4% and 76.28% respectively.
- Jia, Yangqing, et al. 2014. Caffe: Convolutional architecture for fast feature embedding. In Proceedings of the 22nd ACM international conference on Multimedia. ACM, 2014. Google Scholar
Digital Library
- Liu L, Wang S, Su G, et al.2017. Towards Complex Activity Recognition Using a Bayesian Network-Based Probabilitic Generative Framework{J}.Pattern Recognition, 2017. Google ScholarDigital Library
- Krongold B S, Ramchandran K, Jones D L. Computationally efficient optimal power allocation algorithms for multicarrier communication systems{J}. IEEE Trans on Commun, 2000, 48: 23--27.Google ScholarCross Ref
- Liu, Li and Wang, Shu and Su, Guoxin and Huang, Zi-Gang and Liu, Ming. 2017. Towards complex activity recognition using a Bayesian network-based probabilistic generative framework. Pattern Recognition, vol. 68, pp. 295--309, 2017 Google ScholarDigital Library
- Ayyaz, Muhammad Naeem and Javed, Imran and Mahmood, Waqar. 2016. Handwritten Character Recognition Using Multiclass SVM Classification with Hybrid Feature Extraction. Pakistan Journal of Engineering and Applied Sciences, 2016Google Scholar
- Rokach L. A survey of Clustering Algorithms{M}// Data Mining and Knowledge Discovery Handbook. 2009:269--298.Google Scholar
- Kang S H, Sandberg B, Yip A M. A regularized k-means and multiphase scale segmentation{J}. Inverse Problems & Imaging, 2017, 5(2):407--429.Google ScholarCross Ref
- Sharma N, Gaud N. K-modes Clustering Algorithm for Categorical Data{J}. International Journal of Computer Applications, 2015, 127(1):46.Google ScholarCross Ref
- Springer U S. CLARANS (Clustering Large Applications Based Upon Randomized Search){J}. Encyclopedia of Database Systems, 2009:330--330.Google Scholar
- Shen J, Hao X, Liang Z, et al. Real-Time Superpixel Segmentation by DBSCAN Clustering Algorithm{J}. IEEE Transactions on Image Processing, 2016, 25(12):5933--5942. Google ScholarDigital Library
- Jia, Yangqing and Shelhamer, Evan and et al. 2014. Caffe: Convolutional architecture for fast feature embedding. In Proceedings of the 22nd ACM international conference on Multimedia, pp. 675--678, 2014 Google ScholarDigital Library
- Saravanan D, Srinivasan S. Video Data Mining Information Retrieval Using BIRCH Clustering Technique{J}. 2015, 325:583--594.Google ScholarCross Ref
- Xavier Parra,Jorge L.Reyes-Oritiz,et al.Energy Efficient Smartphone-Based Activity Rexognition using Fixed-Point Arithmetic{J}.2013.Google Scholar
Index Terms
- Clustering Analysis of Human Behavior Based on Mobile Phone Sensor Data
Recommendations
Data depth based clustering analysis
SIGSPACIAL '16: Proceedings of the 24th ACM SIGSPATIAL International Conference on Advances in Geographic Information SystemsThis paper proposes a new algorithm for identifying patterns within data, based on data depth. Such a clustering analysis has an enormous potential to discover previously unknown insights from existing data sets. Many clustering algorithms already exist ...
Far efficient K-means clustering algorithm
ICACCI '12: Proceedings of the International Conference on Advances in Computing, Communications and InformaticsClustering in data analysis means data with similar features are grouped together within a particular valid cluster. Each cluster consists of data that are more similar among themselves and dissimilar to data of other clusters. Clustering can be viewed ...
Evolutionary rough k-medoid clustering
Transactions on rough sets VIIIRecently, clustering algorithms based on rough set theory have gained increasing attention. For example, Lingras et al. introduced a rough k-means that assigns objects to lower and upper approximations of clusters. The objects in the lower approximation ...
Comments