62
Views
0
CrossRef citations to date
0
Altmetric
Computers and Computing

Graph Laplacian for Heterogeneous Data Clustering in Sensor-Based Internet of Things

, , , &

References

  • V. K. Singh, C. Singh, and H. Raza, “Event classification and intensity discrimination for forest fire inference with IoT,” IEEE Sensors J., Vol. 22, no. 9, pp. 8869–8880, 2022. DOI:10.1109/JSEN.2022.3163155
  • V. K. Singh, V. K. Singh, and M. Kumar, “Network health monitoring of WSNs using node loss rate calculations,” Wirel. Pers. Commun., Vol. 108, no. 1, pp. 253–268, 2019. DOI:10.1007/s11277-019-06400-3
  • A. Shivhare, V. K. Singh, and M. Kumar, “Anticomplementary triangles for efficient coverage in sensor network-based IoT,” IEEE Sys. J., Vol. 14, no. 4, pp. 4854–4863, 2020. DOI:10.1109/JSYST.2020.2967838
  • V. K. Singh, B. Nathani, and M. Kumar, “WEED-MC: Wavelet transform for energy efficient data gathering and matrix completion,” IEEE Trans. Parallel Distrib. Sys., Vol. 31, no. 5, pp. 1066–1073, 2019. DOI:10.1109/TPDS.2019.2954902
  • A. Shukla, V. K. Singh, and M. Kalra, “Multimodal device clustering using mobile agent for correlation in sensor-based IoT.,” Adhoc Sensor Wirel. Networks, Vol. 48, pp. 121–144, 2020.
  • A. P. Dempster, N. M. Laird, and D. B. Rubin, “Maximum likelihood from incomplete data via the EM algorithm,” J. Royal Stat. Soc.: Series B (Methodological), Vol. 39, no. 1, pp. 1–22, 1977. DOI:10.1111/j.2517-6161.1977.tb01600.x
  • S. Guha, R. Rastogi, and K. Shim, “Rock: A robust clustering algorithm for categorical attributes,” Inf. Sys., Vol. 25, no. 5, pp. 345–366, 2000. DOI:10.1016/S0306-4379(00)00022-3
  • Z. Huang, “Extensions to the k-means algorithm for clustering large data sets with categorical values,” Data Mining Knowl. Discovery, Vol. 2, no. 3, pp. 283–304, 1998. DOI:10.1023/A:1009769707641
  • D. Gibson, J. Kleinberg, and P. Raghavan, “Clustering categorical data: An approach based on dynamical systems,” VLDB J. Int. J. Very Large Data Bases, Vol. 8, no. 3, pp. 222–236, 2000.
  • D. Parmar, T. Wu, and J. Blackhurst, “Mmr: An algorithm for clustering categorical data using rough set theory,” Data Knowl. Eng., Vol. 63, no. 3, pp. 879–893, 2007. DOI:10.1016/j.datak.2007.05.005
  • P. Kumar, and B. Tripathy, “Mmer: An algorithm for clustering heterogeneous data using rough set theory,” Int. J. Rapid Manufact., Vol. 1, no. 2, pp. 189–207, 2009. DOI:10.1504/IJRAPIDM.2009.029382
  • L. Adamyan, K. Efimov, C. Y. Chen, and W. K. Hardle, “Adaptive weights clustering of research papers,” Digital Finance, Vol. 2, no. 3, pp. 169–187, 2020. DOI:10.1007/s42521-020-00017-z
  • A. Khan, and P. Maji, “Approximate Graph Laplacians for multimodal data clustering,” IEEE Trans. Pattern Anal. Mach. Intell., Vol. 43, no. 3, pp. 798–813, 2021. DOI:10.1109/TPAMI.2019.2945574
  • X. Ma, S. Zhang, K. Pena-Pena, and G. R. Arce, “Fast spectral clustering method based on graph similarity matrix completion,” Sign. Proces., Vol. 189 (2021).
  • Y. Ge, P. Peng, and H. Lu, “Mixed-order spectral clustering for complex networks,” Pattern Recogn., Vol. 117 (2021).
  • H. Yang, Q. Gao, W. Xia, M. Yang, and X. Gao, “Multiview spectral clustering with bipartite graph,” IEEE Trans Image Proces., Vol. 31, pp. 3591–3605, 2022. DOI:10.1109/TIP.2022.3171411
  • U. Von Luxburg, “A tutorial on spectral clustering,” Stat. Comput., Vol. 17, no. 4, pp. 395–416, 2007. DOI:10.1007/s11222-007-9033-z
  • F. Nie, C.-L. Wang, and X. Li. “K-multiple-means: A multiple-means clustering method with specified k clusters,” in Proceedings of the 25th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining, pp. 959–967, 2019.
  • M. E. Basbug, and B. Engelhardt. “Adacluster: Adaptive clustering for heterogeneous data,” arXiv preprint arXiv:1510.05491, 2015.

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.