Open Access. Powered by Scholars. Published by Universities.®
Physical Sciences and Mathematics Commons™
Open Access. Powered by Scholars. Published by Universities.®
- Discipline
- Institution
Articles 1 - 7 of 7
Full-Text Articles in Physical Sciences and Mathematics
Base-Package Recommendation Framework Based On Consumer Behaviours In Iptv Platform, Kuruparan Shanmugalingam, Ruwinda Ranganayanke, Chanka Gunawardhaha, Rajitha Navarathna
Base-Package Recommendation Framework Based On Consumer Behaviours In Iptv Platform, Kuruparan Shanmugalingam, Ruwinda Ranganayanke, Chanka Gunawardhaha, Rajitha Navarathna
Research Collection School Of Computing and Information Systems
Internet Protocol TeleVision (IPTV) provides many services such as live television streaming, time-shifted media, and Video On Demand (VOD). However, many customers do not engage properly with their subscribed packages due to a lack of knowledge and poor guidance. Many customers fail to identify the proper IPTV service package based on their needs and to utilise their current package to the maximum. In this paper, we propose a base-package recommendation model with a novel customer scoring-meter based on customers behaviour. Initially, our paper describes an algorithm to measure customers engagement score, which illustrates a novel approach to track customer engagement …
An Explainable And Statistically Validated Ensemble Clustering Model Applied To The Identification Of Traumatic Brain Injury Subgroups, Dacosta Yeboah, Louis Steinmeister, Daniel B. Hier, Bassam Hadi, Donald C. Wunsch, Gayla R. Olbricht, Tayo Obafemi-Ajayi
An Explainable And Statistically Validated Ensemble Clustering Model Applied To The Identification Of Traumatic Brain Injury Subgroups, Dacosta Yeboah, Louis Steinmeister, Daniel B. Hier, Bassam Hadi, Donald C. Wunsch, Gayla R. Olbricht, Tayo Obafemi-Ajayi
Electrical and Computer Engineering Faculty Research & Creative Works
We present a framework for an explainable and statistically validated ensemble clustering model applied to Traumatic Brain Injury (TBI). The objective of our analysis is to identify patient injury severity subgroups and key phenotypes that delineate these subgroups using varied clinical and computed tomography data. Explainable and statistically-validated models are essential because a data-driven identification of subgroups is an inherently multidisciplinary undertaking. In our case, this procedure yielded six distinct patient subgroups with respect to mechanism of injury, severity of presentation, anatomy, psychometric, and functional outcome. This framework for ensemble cluster analysis fully integrates statistical methods at several stages of …
An Energy Efficient Routing Approach For Iot Enabled Underwater Wsns In Smart Cities, Nighat Usman, Omar Alfandi, Saeeda Usman, Asad Masood Khattak, Muhammad Awais, Bashir Hayat, Ahthasham Sajid
An Energy Efficient Routing Approach For Iot Enabled Underwater Wsns In Smart Cities, Nighat Usman, Omar Alfandi, Saeeda Usman, Asad Masood Khattak, Muhammad Awais, Bashir Hayat, Ahthasham Sajid
All Works
© 2020 by the authors. Licensee MDPI, Basel, Switzerland. Nowadays, there is a growing trend in smart cities. Therefore, Terrestrial and Internet of Things (IoT) enabled Underwater Wireless Sensor Networks (TWSNs and IoT-UWSNs) are mostly used for observing and communicating via smart technologies. For the sake of collecting the desired information from the underwater environment, multiple acoustic sensors are deployed with limited resources, such as memory, battery, processing power, transmission range, etc. The replacement of resources for a particular node is not feasible due to the harsh underwater environment. Thus, the resources held by the node needs to be used …
The K-Means Algorithm: A Comprehensive Survey And Performance Evaluation, Mohiuddin Ahmed, Raihan Seraj, Syed Mohammed Shamsul Islam
The K-Means Algorithm: A Comprehensive Survey And Performance Evaluation, Mohiuddin Ahmed, Raihan Seraj, Syed Mohammed Shamsul Islam
Research outputs 2014 to 2021
© 2020 by the authors. Licensee MDPI, Basel, Switzerland. The k-means clustering algorithm is considered one of the most powerful and popular data mining algorithms in the research community. However, despite its popularity, the algorithm has certain limitations, including problems associated with random initialization of the centroids which leads to unexpected convergence. Additionally, such a clustering algorithm requires the number of clusters to be defined beforehand, which is responsible for different cluster shapes and outlier effects. A fundamental problem of the k-means algorithm is its inability to handle various data types. This paper provides a structured and synoptic overview of …
Robust Graph Learning From Noisy Data, Zhao Kang, Haiqi Pan, Steven C. H. Hoi, Zenglin Xu
Robust Graph Learning From Noisy Data, Zhao Kang, Haiqi Pan, Steven C. H. Hoi, Zenglin Xu
Research Collection School Of Computing and Information Systems
Learning graphs from data automatically have shown encouraging performance on clustering and semisupervised learning tasks. However, real data are often corrupted, which may cause the learned graph to be inexact or unreliable. In this paper, we propose a novel robust graph learning scheme to learn reliable graphs from the real-world noisy data by adaptively removing noise and errors in the raw data. We show that our proposed model can also be viewed as a robust version of manifold regularized robust principle component analysis (RPCA), where the quality of the graph plays a critical role. The proposed model is able to …
A New Intra-Cluster Scheduling Scheme For Real-Time Flows In Wireless Sensor Networks, Gohar Ali, Fernando Moreira, Omar Alfandi, Babar Shah, Mohammed Ilyas
A New Intra-Cluster Scheduling Scheme For Real-Time Flows In Wireless Sensor Networks, Gohar Ali, Fernando Moreira, Omar Alfandi, Babar Shah, Mohammed Ilyas
All Works
© 2020 by the authors. Licensee MDPI, Basel, Switzerland. Real-time flows using time division multiple access (TDMA) scheduling in cluster-based wireless sensor networks try to schedule more flows per time frame to minimize the schedule length to meet the deadline. The problem with the previously used cluster-based scheduling algorithm is that intra-cluster scheduling does not consider that the clusters may have internal or outgoing flows. Thus, intra-cluster scheduling algorithms do not utilize their empty time-slots and thus increase schedule length. In this paper, we propose a new intra-cluster scheduling algorithm by considering that clusters may have having internal or outgoing …
Space-Time Hierarchical Clustering For Identifying Clusters In Spatiotemporal Point Data, David S. Lamb, Joni Downs, Steven Reader
Space-Time Hierarchical Clustering For Identifying Clusters In Spatiotemporal Point Data, David S. Lamb, Joni Downs, Steven Reader
School of Geosciences Faculty and Staff Publications
Finding clusters of events is an important task in many spatial analyses. Both confirmatory and exploratory methods exist to accomplish this. Traditional statistical techniques are viewed as confirmatory, or observational, in that researchers are confirming an a priori hypothesis. These methods often fail when applied to newer types of data like moving object data and big data. Moving object data incorporates at least three parts: location, time, and attributes. This paper proposes an improved space-time clustering approach that relies on agglomerative hierarchical clustering to identify groupings in movement data. The approach, i.e., space–time hierarchical clustering, incorporates location, time, and attribute …