{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,2]],"date-time":"2026-05-02T04:20:29Z","timestamp":1777695629035,"version":"3.51.4"},"reference-count":39,"publisher":"MDPI AG","issue":"4","license":[{"start":{"date-parts":[[2018,4,15]],"date-time":"2018-04-15T00:00:00Z","timestamp":1523750400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"name":"EC Horizon 2020","award":["CNECT-ICT-643943"],"award-info":[{"award-number":["CNECT-ICT-643943"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Sensors"],"abstract":"<jats:p>In this paper, we present a novel data clustering framework for big sensory data produced by IoT applications. Based on a network representation of the relations among multi-dimensional data, data clustering is mapped to node clustering over the produced data graphs. To address the potential very large scale of such datasets\/graphs that test the limits of state-of-the-art approaches, we map the problem of data clustering to a community detection one over the corresponding data graphs. Specifically, we propose a novel computational approach for enhancing the traditional Girvan\u2013Newman (GN) community detection algorithm via hyperbolic network embedding. The data dependency graph is embedded in the hyperbolic space via Rigel embedding, allowing more efficient computation of edge-betweenness centrality needed in the GN algorithm. This allows for more efficient clustering of the nodes of the data graph in terms of modularity, without sacrificing considerable accuracy. In order to study the operation of our approach with respect to enhancing GN community detection, we employ various representative types of artificial complex networks, such as scale-free, small-world and random geometric topologies, and frequently-employed benchmark datasets for demonstrating its efficacy in terms of data clustering via community detection. Furthermore, we provide a proof-of-concept evaluation by applying the proposed framework over multi-dimensional datasets obtained from an operational smart-city\/building IoT infrastructure provided by the Federated Interoperable Semantic IoT\/cloud Testbeds and Applications (FIESTA-IoT) testbed federation. It is shown that the proposed framework can be indeed used for community detection\/data clustering and exploited in various other IoT applications, such as performing more energy-efficient smart-city\/building sensing.<\/jats:p>","DOI":"10.3390\/s18041205","type":"journal-article","created":{"date-parts":[[2018,4,16]],"date-time":"2018-04-16T03:12:09Z","timestamp":1523848329000},"page":"1205","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":11,"title":["Big Data Clustering via Community Detection and Hyperbolic Network Embedding in IoT Applications"],"prefix":"10.3390","volume":"18","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-2841-9925","authenticated-orcid":false,"given":"Vasileios","family":"Karyotis","sequence":"first","affiliation":[{"name":"Institute of Communication and Computer Systems (ICCS), School of Electrical and Computer Engineering, National Technical University of Athens (NTUA), Athens 157 80, Greece"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7537-9965","authenticated-orcid":false,"given":"Konstantinos","family":"Tsitseklis","sequence":"additional","affiliation":[{"name":"Institute of Communication and Computer Systems (ICCS), School of Electrical and Computer Engineering, National Technical University of Athens (NTUA), Athens 157 80, Greece"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Konstantinos","family":"Sotiropoulos","sequence":"additional","affiliation":[{"name":"Institute of Communication and Computer Systems (ICCS), School of Electrical and Computer Engineering, National Technical University of Athens (NTUA), Athens 157 80, Greece"},{"name":"Department of Computer Science, Boston University, Boston, MA 02215, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9459-318X","authenticated-orcid":false,"given":"Symeon","family":"Papavassiliou","sequence":"additional","affiliation":[{"name":"Institute of Communication and Computer Systems (ICCS), School of Electrical and Computer Engineering, National Technical University of Athens (NTUA), Athens 157 80, Greece"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"1968","published-online":{"date-parts":[[2018,4,15]]},"reference":[{"key":"ref_1","unstructured":"Cheng, S., Cai, Z., Li, J., and Fang, X. (May, January 26). Drawing Dominant Dataset from Big Sensory Data in Wireless Sensor Networks. Proceedings of the IEEE Conference on Computer Communications (INFOCOM), Hong Kong, China."},{"key":"ref_2","doi-asserted-by":"crossref","first-page":"813","DOI":"10.1109\/TKDE.2016.2645212","article-title":"Extracting Kernel Dataset from Big Sensory Data in Wireless Sensor Networks","volume":"29","author":"Cheng","year":"2017","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"ref_3","doi-asserted-by":"crossref","first-page":"11","DOI":"10.1109\/MNET.2016.7389825","article-title":"A Hyperbolic Space Analytics Framework for Big Network Data and their Applications","volume":"30","author":"Stai","year":"2016","journal-title":"IEEE Netw. Mag."},{"key":"ref_4","unstructured":"(2018, January 22). FIESTA-IoT Project, Federated Interoperable Semantic IoT Testbeds and Applications. Available online: http:\/\/www.fiesta-iot.eu\/."},{"key":"ref_5","doi-asserted-by":"crossref","first-page":"264","DOI":"10.1145\/331499.331504","article-title":"Data Clustering: A Review","volume":"31","author":"Jain","year":"1999","journal-title":"ACM Comput. Surv."},{"key":"ref_6","unstructured":"Cheng, B., Longo, S., Cirillo, F., Bauer, M., and Kovacs, E. (July, January 27). Building a Big Data Platform for Smart Cities: Experience and Lessons from Santander. Proceedings of the IEEE International Congress on Big Data, New York, NY, USA."},{"key":"ref_7","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1016\/j.physrep.2009.11.002","article-title":"Community Detection in Graphs","volume":"486","author":"Fortunato","year":"2010","journal-title":"Phys. Rep."},{"key":"ref_8","doi-asserted-by":"crossref","first-page":"7821","DOI":"10.1073\/pnas.122653799","article-title":"Community Structure in Social and Biological Networks","volume":"99","author":"Girvan","year":"2002","journal-title":"Proc. Natl. Acad. Sci. USA"},{"key":"ref_9","unstructured":"Sarwar, B.M., Karypis, G., Konstan, J., and Riedl, J. (2002, January 27\u201328). Recommender Systems for Large-scale E-commerce: Scalable Neighborhood Formation using Clustering. Proceedings of the 5th International Conference on Computer and Information Technology, Dhaka, Bangladesh."},{"key":"ref_10","first-page":"64","article-title":"Data Mining Applications in Healthcare","volume":"19","author":"Koh","year":"2005","journal-title":"J. Healthc. Inf. Manag."},{"key":"ref_11","first-page":"100","article-title":"Algorithm AS 136: A k-means Clustering Algorithm","volume":"28","author":"Hartigan","year":"1979","journal-title":"J. R. Stat. Soc. Ser. C"},{"key":"ref_12","doi-asserted-by":"crossref","first-page":"1003","DOI":"10.1109\/TKDE.2002.1033770","article-title":"CLARANS: A Method for Clustering Objects for Spatial Data Mining","volume":"14","author":"Ng","year":"2002","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"ref_13","doi-asserted-by":"crossref","unstructured":"Zhang, T., Ramakrishnan, R., and Livny, M. (1996). BIRCH: An Efficient Data Clustering Method for Very Large Databases. ACM Sigmod Record, ACM Digital Library. No. 2.","DOI":"10.1145\/235968.233324"},{"key":"ref_14","doi-asserted-by":"crossref","first-page":"68","DOI":"10.1109\/2.781637","article-title":"Chameleon: Hierarchical Clustering using Dynamic Modeling","volume":"32","author":"Karypis","year":"1999","journal-title":"IEEE Comput. Mag."},{"key":"ref_15","unstructured":"Wang, W., Yang, J., and Muntz, R. (1997, January 25\u201329). STING: A Statistical Information Grid Approach to Spatial Data Mining. Proceedings of the 23rd International Conference on Very Large Data Bases (VLDB), Athens, Greece."},{"key":"ref_16","unstructured":"Sheikholeslami, G., Chatterjee, S., and Zhang, A. (1998, January 24\u201327). Wavecluster: A Multi-resolution Clustering Approach for Very Large Spatial Databases. Proceedings of the 24th International Conference on Very Large Data Bases (VLDB), New York, NY, USA."},{"key":"ref_17","unstructured":"Ester, M., Kriegel, H.P., Sander, J., and Xu, X. (1996, January 2\u20134). A Density-based Algorithm for Discovering Clusters in Large Spatial Databases with Noise. Proceedings of the 2nd International Conference on Knowledge Discovery and Data Mining (KDD), Portland, Oregon."},{"key":"ref_18","doi-asserted-by":"crossref","unstructured":"Zhao, W., Ma, H., and He, Q. (2009, January 1\u20134). Parallel k-means Clustering based on MapReduce. Proceedings of the IEEE International Conference on Cloud Computing (CloudCom), Beijing, China.","DOI":"10.1007\/978-3-642-10665-1_71"},{"key":"ref_19","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1007\/s11704-013-3158-3","article-title":"MR-DBSCAN: A Scalable MapReduce-based DBSCAN Algorithm for Heavily Skewed Data","volume":"8","author":"He","year":"2014","journal-title":"Front. Comput. Sci."},{"key":"ref_20","doi-asserted-by":"crossref","first-page":"15","DOI":"10.1016\/j.is.2013.11.002","article-title":"DBCURE-MR: An Efficient Density-based Clustering Algorithm for Large Data using MapReduce","volume":"42","author":"Kim","year":"2014","journal-title":"Inf. Syst."},{"key":"ref_21","doi-asserted-by":"crossref","first-page":"275","DOI":"10.1016\/0167-8191(89)90036-7","article-title":"Parallel Clustering Algorithms","volume":"11","author":"Li","year":"1989","journal-title":"Parallel Comput."},{"key":"ref_22","unstructured":"Brandes, U., Delling, D., Gaertler, M., Goerke, R., Hoefer, M., Nikoloski, Z., and Wagner, D. (arXiv, 2006). Maximizing Modularity is Hard, arXiv."},{"key":"ref_23","doi-asserted-by":"crossref","unstructured":"Papadopoulos, F., Krioukov, D., Boguna, M., and Vahdat, A. (2010, January 14\u201319). Greedy Forwarding in Dynamic Scale-Free Networks Embedded in Hyperbolic Metric Spaces. Proceedings of the IEEE INFOCOM, San Diego, CA, USA.","DOI":"10.1109\/INFCOM.2010.5462131"},{"key":"ref_24","doi-asserted-by":"crossref","unstructured":"Cvetkovski, A., and Crovella, M. (2009, January 19\u201325). Hyperbolic Embedding and Routing for Dynamic Graphs. Proceedings of the IEEE INFOCOM, Rio de Janeiro, Brazil.","DOI":"10.1109\/INFCOM.2009.5062083"},{"key":"ref_25","doi-asserted-by":"crossref","unstructured":"Zhao, X., Sala, A., Zheng, H., and Zhao, B.Y. (2011, January 15\u201318). Efficient Shortest Paths on Massive Social Graphs. Proceedings of the 2011 7th International Conference on Collaborative Computing: Networking, Applications and Worksharing (CollaborateCom), Orlando, FL, USA.","DOI":"10.4108\/icst.collaboratecom.2011.247162"},{"key":"ref_26","doi-asserted-by":"crossref","first-page":"198","DOI":"10.1109\/TNET.2013.2294052","article-title":"Network Mapping by Replaying Hyperbolic Growth","volume":"23","author":"Papadopoulos","year":"2015","journal-title":"IEEE\/ACM Trans. Netw."},{"key":"ref_27","unstructured":"Zhao, X., Sala, A., Wilson, C., Zheng, H., and Zhao, B.Y. (2010, January 22). Orion: Shortest Path Estimation for Large Social Graphs. Proceedings of the 3rd Conference on Online Social Networks, Boston, MA, USA."},{"key":"ref_28","doi-asserted-by":"crossref","unstructured":"Karyotis, V., Stai, E., and Papavassiliou, S. (2013). Evolutionary Dynamics of Complex Communications Networks, CRC Press\u2014Taylor & Francis Group.","DOI":"10.1201\/b15505"},{"key":"ref_29","doi-asserted-by":"crossref","first-page":"136","DOI":"10.1016\/j.socnet.2007.11.001","article-title":"On Variants of Shortest-Path Betweenness Centrality and their Generic Computation","volume":"30","author":"Brandes","year":"2008","journal-title":"Soc. Netw."},{"key":"ref_30","doi-asserted-by":"crossref","first-page":"140","DOI":"10.1109\/TNSE.2017.2690258","article-title":"Hyperbolic Embedding for Efficient Computation of Path Centralities and Adaptive Routing in Large-Scale Complex Commodity Networks","volume":"4","author":"Stai","year":"2017","journal-title":"IEEE Trans Netw. Sci. Eng."},{"key":"ref_31","doi-asserted-by":"crossref","first-page":"128","DOI":"10.1109\/MCOM.2002.1018018","article-title":"Position based Routing in Ad Hoc Networks","volume":"40","author":"Stojmenovic","year":"2002","journal-title":"IEEE Commun. Mag."},{"key":"ref_32","doi-asserted-by":"crossref","unstructured":"Fodor, I.K. (2002). A Survey of Dimension Reduction Techniques.","DOI":"10.2172\/15002155"},{"key":"ref_33","doi-asserted-by":"crossref","first-page":"439","DOI":"10.1142\/S0218195912500112","article-title":"Proximity Graphs: E, \u03b4, \u03c7 and \u03c9","volume":"22","author":"Bose","year":"2012","journal-title":"Int. J. Comput. Geom. Appl."},{"key":"ref_34","unstructured":"Zemel, R.S., and Carreira-Perpin\u00e1n, M.A. (2005, January 5\u20138). Proximity Graphs for Clustering and Manifold Learning. Proceedings of the Advances in Neural Information Processing Systems (NIPS), Vancouver, BC, Canada."},{"key":"ref_35","unstructured":"(2018, January 22). Network Data Repository. Available online: http:\/\/www-personal.umich.edu\/~mejn\/netdata\/."},{"key":"ref_36","doi-asserted-by":"crossref","first-page":"046110","DOI":"10.1103\/PhysRevE.78.046110","article-title":"Benchmark graphs for testing community detection algorithms","volume":"78","author":"Lancichinetti","year":"2008","journal-title":"Phys. Rev. E"},{"key":"ref_37","doi-asserted-by":"crossref","first-page":"P10008","DOI":"10.1088\/1742-5468\/2008\/10\/P10008","article-title":"Fast Unfolding of Communities in Large Networks","volume":"2008","author":"Blondel","year":"2008","journal-title":"J. Stat. Mech. Theory Exp."},{"key":"ref_38","doi-asserted-by":"crossref","first-page":"509","DOI":"10.1126\/science.286.5439.509","article-title":"Emergence of Scaling in Random Networks","volume":"286","author":"Barabasi","year":"1999","journal-title":"Science"},{"key":"ref_39","unstructured":"(2018, February 22). SmartSantander Testbed. Available online: http:\/\/www.smartsantander.eu\/index.php\/testbeds\/."}],"container-title":["Sensors"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/1424-8220\/18\/4\/1205\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T15:00:47Z","timestamp":1760194847000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/1424-8220\/18\/4\/1205"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,4,15]]},"references-count":39,"journal-issue":{"issue":"4","published-online":{"date-parts":[[2018,4]]}},"alternative-id":["s18041205"],"URL":"https:\/\/doi.org\/10.3390\/s18041205","relation":{},"ISSN":["1424-8220"],"issn-type":[{"value":"1424-8220","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,4,15]]}}}