Extending External Agent Capabilities in Healthcare Social Networks

A social health care system, such as palliative care, can be viewed as a social network of interacting patients and care providers. Each patient in the network has a set of capabilities to perform his or her intended daily tasks. However, some patients may not have the required capabilities to carry out their desired tasks. Consequently, different groups of care providers - consist of doctors, volunteers, nurses, etc.- offer the patients support by providing them with a variety of needed services. Assuming there are a cost and resource limitations for providing care within the system, where each care provider can support a limited number of patients, the problem is to find a set of suitable care providers to match the needs of the maximum number of patients. In this dissertation, we propose a novel agent-based model to address this problem by extending the agent\u27s capabilities using the benefit of the social network. Our assumption is that each agent, or patient, can cover its disabilities and perform its desired tasks through collaboration with other agents, or care providers, in the network. The goal of this work is to improve the quality of services in the network at both individual and system levels. On the one hand, an individual patient wants to maximize the quality of his/her life, while at the system level we want to achieve quality care for as many patients as possible with minimum cost. The performance and functionality of this proposed model have been evaluated based on various synthetic networks. The results demonstrate a significant reduction in the operational costs and enhancement of the service quality

Fast & Efficient Learning of Bayesian Networks from Data: Knowledge Discovery and Causality

Structure learning is essential for Bayesian networks (BNs) as it uncovers causal relationships, and enables knowledge discovery, predictions, inferences, and decision-making under uncertainty. Two novel algorithms, FSBN and SSBN, based on the PC algorithm, employ local search strategy and conditional independence tests to learn the causal network structure from data. They incorporate d-separation to infer additional topology information, prioritize conditioning sets, and terminate the search immediately and efficiently. FSBN achieves up to 52% computation cost reduction, while SSBN surpasses it with a remarkable 72% reduction for a 200-node network. SSBN demonstrates further efficiency gains due to its intelligent strategy. Experimental studies show that both algorithms match the induction quality of the PC algorithm while significantly reducing computation costs. This enables them to offer interpretability and adaptability while reducing the computational burden, making them valuable for various applications in big data analytics

Inclusion in Virtual Reality Technology: A Scoping Review

Despite the significant growth in virtual reality applications and research, the notion of inclusion in virtual reality is not well studied. Inclusion refers to the active involvement of different groups of people in the adoption, use, design, and development of VR technology and applications. In this review, we provide a scoping analysis of existing virtual reality research literature about inclusion. We categorize the literature based on target group into ability, gender, and age, followed by those that study community-based design of VR experiences. In the latter group, we focus mainly on Indigenous Peoples as a clearer and more important example. We also briefly review the approaches to model and consider the role of users in technology adoption and design as a background for inclusion studies. We identify a series of generic barriers and research gaps and some specific ones for each group, resulting in suggested directions for future research

Social Network Analysis: A Machine Learning Approach

Social Network Analysis (SNA) is an appealing research topic, within the domain of Artificial Intelligence (AI), owing to its widespread application in the real world. In this dissertation, we have proposed effective Machine Learning (ML) and Deep Learning (DL) approaches toward resolving these open problems with regard to SNA, viz: Breakup Prediction, Link Prediction, Node Classification, Event-based Analysis, and Trend/Pattern Analysis. SNA can be employed toward resolving several real-world problems; and ML as well as DL have proven to be very effective methodologies for accomplishing Artificial Intelligence (AI)- related goals. Existing literature have focused on studying the apparent and latent interactions within social graphs as an n-ary operation, which yields binary outputs comprising positives (friends, likes, etc.) and negatives (foes, dislikes, etc.). Inasmuch as interactions constitute the bedrock of any given Social Network (SN) structure; there exist scenarios where an interaction, which was once considered a positive, transmutes into a negative as a result of one or more indicators which have affected the interaction quality. At present, this transmutation has to be manually executed by the affected actors in the SN. These manual transmutations can be quite inefficient, ineffective, and a mishap might have been incurred by the constituent actors and the SN structure prior to a resolution. Thus, as part of the research contributions of this dissertation, we have proposed an automatic technique toward flagging positive ties that should be considered for breakups or rifts (negative-tie state), as they tend to pose potential threats to actors and the SN. Furthermore, in this dissertation, we have proposed DL-based approaches based on edge sampling strategy for resolving the problems of Breakup Prediction, Link Prediction, and Node Classification. Also, we have proposed ML-based approaches for resolving the problems of Event-based Analysis and Trend/Pattern Analysis. We have evaluated our respective approaches against benchmark social graphs, and our results have been comparatively encouraging as documented herein

Social Network Analysis using Cultural Algorithms and its Variants

Finding relationships between social entities and discovering the underlying structures of networks are fundamental tasks for analyzing social networks. In recent years, various methods have been suggested to study these networks efficiently, however, due to the dynamic and complex nature that these networks have, a lot of open problems still exist in the field. The aim of this research is to propose an integrated computational model to study the structure and behavior of the complex social network. The focus of this research work is on two major classic problems in the field which are called community detection and link prediction. Moreover, a problem of population adaptation through knowledge migration in real-life social systems has been identified to model and study through the proposed method. To the best of our knowledge, this is the first work in the field which is exploring this concept through this approach. In this research, a new adaptive knowledge-based evolutionary framework is defined to investigate the structure of social networks by adopting a multi-population cultural algorithm. The core of the model is designed based on a unique community-oriented approach to estimate the existence of a relationship between social entities in the network. In each evolutionary cycle, the normative knowledge is shaped through the extraction of the topological knowledge from the structure of the network. This source of knowledge is utilized for the various network analysis tasks such as estimating the quality of relation between social entities, related studies regarding the link prediction, population adaption, and knowledge formation. The main contributions of this work can be summarized in introducing a novel method to define, extract and represent different sources of knowledge from a snapshot of a given network to determine the range of the optimal solution, and building a probability matrix to show the quality of relations between pairs of actors in the system. Introducing a new similarity metric, utilizing the prior knowledge in dynamic social network analysis and study the co-evolution of societies in a case of individual migration are another major contributions of this work. According to the obtained results, utilizing the proposed approach in community detection problem can reduce the search space size by 80%. It also can improve the accuracy of the search process in high dense networks by up to 30% compared with the other well-known methods. Addressing the link prediction problem through the proposed approach also can reach the comparable results with other methods and predict the next state of the system with a notably high accuracy. In addition, the obtained results from the study of population adaption through knowledge migration indicate that population with prior knowledge about an environment can adapt themselves to the new environment faster than the ones who do not have this knowledge if the level of changes between the two environments is less than 25%. Therefore, utilizing this approach in dynamic social network analysis can reduce the search time and space significantly (up to above 90%), if the snapshots of the system are taken when the level of changes in the network structure is within 25%. In summary, the experimental results indicate that this knowledge-based approach is capable of exploring the evolution and structure of the network with the high level of accuracy while it improves the performance by reducing the search space and processing time

Hierarchical Classification and its Application in University Search

Web search engines have been adopted by most universities for searching webpages in their own domains. Basically, a user sends keywords to the search engine and the search engine returns a flat ranked list of webpages. However, in university search, user queries are usually related to topics. Simple keyword queries are often insufficient to express topics as keywords. On the other hand, most E-commerce sites allow users to browse and search products in various hierarchies. It would be ideal if hierarchical browsing and keyword search can be seamlessly combined for university search engines. The main difficulty is to automatically classify and rank a massive number of webpages into the topic hierarchies for universities. In this thesis, we use machine learning and data mining techniques to build a novel hybrid search engine with integrated hierarchies for universities, called SEEU (Search Engine with hiErarchy for Universities). Firstly, we study the problem of effective hierarchical webpage classification. We develop a parallel webpage classification system based on Support Vector Machines. With extensive experiments on the well-known ODP (Open Directory Project) dataset, we empirically demonstrate that our hierarchical classification system is very effective and outperforms the traditional flat classification approaches significantly. Secondly, we study the problem of integrating hierarchical classification into the ranking system of keywords-based search engines. We propose a novel ranking framework, called ERIC (Enhanced Ranking by hIerarchical Classification), for search engines with hierarchies. Experimental results on four large-scale TREC (Text REtrieval Conference) web search datasets show that our ranking system with hierarchical classification outperforms the traditional flat keywords-based search methods significantly. Thirdly, we propose a novel active learning framework to improve the performance of hierarchical classification, which is important for ranking webpages in hierarchies. From our experiments on the benchmark text datasets, we find that our active learning framework can achieve good classification performance yet save a considerable number of labeling effort compared with the state-of-the-art active learning methods for hierarchical text classification. Fourthly, based on the proposed classification and ranking methods, we present a novel hierarchical classification framework for mining academic topics from university webpages. We build an academic topic hierarchy based on the commonly accepted Wikipedia academic disciplines. Based on this hierarchy, we train a hierarchical classifier and apply it to mine academic topics. According to our comprehensive analysis, the academic topics mined by our method are reasonable and consistent with the real-world topic distribution in universities. Finally, we combine all the proposed techniques together and implement the SEEU search engine. According to two usability studies conducted in the ECE and the CS departments at our university, SEEU is favored by the majority of participants. To conclude, the main contribution of this thesis is a novel search engine, called SEEU, for universities. We discuss the challenges toward building SEEU and propose effective machine learning and data mining methods to tackle them. With extensive experiments on well-known benchmark datasets and real-world university webpage datasets, we demonstrate that our system is very effective. In addition, two usability studies of SEEU in our university show that SEEU has a great promise for university search

Variational Autoencoder Based Estimation Of Distribution Algorithms And Applications To Individual Based Ecosystem Modeling Using EcoSim

Individual based modeling provides a bottom up approach wherein interactions give rise to high-level phenomena in patterns equivalent to those found in nature. This method generates an immense amount of data through artificial simulation and can be made tractable by machine learning where multidimensional data is optimized and transformed. Using individual based modeling platform known as EcoSim, we modeled the abilities of elitist sexual selection and communication of fear. Data received from these experiments was reduced in dimension through use of a novel algorithm proposed by us: Variational Autoencoder based Estimation of Distribution Algorithms with Population Queue and Adaptive Variance Scaling (VAE-EDA-Q AVS). We constructed a novel Estimation of Distribution Algorithm (EDA) by extending generative models known as variational autoencoders (VAE). VAE-EDA-Q, proposed by us, smooths the data generation process using an iteratively updated queue (Q) of populations. Adaptive Variance Scaling (AVS) dynamically updates the variance at which models are sampled based on fitness. The combination of VAE-EDA-Q with AVS demonstrates high computational efficiency and requires few fitness evaluations. We extended VAE-EDA-Q AVS to act as a feature reducing wrapper method in conjunction with C4.5 Decision trees to reduce the dimensionality of data. The relationship between sexual selection, random selection, and speciation is a contested topic. Supporting evidence suggests sexual selection to drive speciation. Opposing evidence contends either a negative or absence of correlation to exist. We utilized EcoSim to model elitist and random mate selection. Our results demonstrated a significantly lower speciation rate, a significantly lower extinction rate, and a significantly higher turnover rate for sexual selection groups. Species diversification was found to display no significant difference. The relationship between communication and foraging behavior similarly features opposing hypotheses in claim of both increases and decreases of foraging behavior in response to alarm communication. Through modeling with EcoSim, we found alarm communication to decrease foraging activity in most cases, yet gradually increase foraging activity in some other cases. Furthermore, we found both outcomes resulting from alarm communication to increase fitness as compared to non-communication

Analyzing the Impacts of Emerging Technologies on Workforce Skills: A Case Study of Industrial Engineering in the Context of the Industrial Internet of Things

New technologies can result in major disruptions and change paradigms that were once well established. Methods have been developed to forecast new technologies and to analyze the impacts of them in terms of processes, products, and services. However, the current literature does not provide answers on how to forecast changes in terms of skills and knowledge, given an emerging technology. This thesis aims to fill this literature gap by developing a structured method to forecast the required set of skills for emerging technologies and to compare it with the current skills of the workforce. The method relies on the breakdown of the emerging technology into smaller components, so then skills can be identified for each component. A case study was conducted to implement and test the proposed method. In this case study, the impacts of the Industrial Internet of Things (IIoT) on engineering skills and knowledge were assessed. Text data analytics validated IIoT as an emerging technology, thus justifying the case study based on engineering and manufacturing discussions. The set of skills required for IIoT was compared to the current skills developed by Industrial Engineering students at the University of Windsor. Text data analytics was also used to evaluate the importance of each IIoT component by measuring how associated individual components are to IIoT. Therefore, existing skill gaps between the current Industrial Engineering program and IIoT requirements were not only mapped, but they were also given weights

Navigating Copyright for Libraries

Much of the information that libraries make available is protected by copyright or subject to the terms of license agreements. This reader presents an overview of current issues in copyright law reform. The chapters present salient points, overviews of the law and legal concepts, selected comparisons of approaches around the world, significance of the topic, and opportunities for reform, advocacy, and other related resources

Towards an authentic argumentation literacy test

A central goal of education is to improve argumentation literacy. How do we know how well this goal is achieved? Can we measure argumentation literacy? The present study is a preliminary step towards measuring the efficacy of education with regards to argumentation literacy. Tests currently in use to determine critical thinking skills are often similar to IQ-tests in that they predominantly measure logical and mathematical abilities. Thus, they may not measure the various other skills required in understanding authentic argumentation. To identify the elements of argumentation literacy, this exploratory study begins by surveying introductory textbooks within argumentation theory, critical thinking, and rhetoric. Eight main abilities have been identified. Then, the study outlines an Argumentation Literacy Test that would comprise these abilities suggested by the literature. Finally, the study presents results from a pilot of a version of such a test and discusses needs for further development