@conference {981, title = {Traditional Bengali Food Classification Using Convolutional Neural Network}, booktitle = {2021 IEEE Region 10 Symposium (TENSYMP)}, year = {2021}, pages = {1-8}, keywords = {Computational modeling, Convolutional Neural Network, Convolutional neural networks, Data models, fine tuning, image classification, Image recognition, Neural networks, traditional Bengali foods, Transfer learning, Turning, VGG16}, doi = {10.1109/TENSYMP52854.2021.9550874}, author = {Uddin, Asif Mahbub and Al Miraj, Abdullah and Sen Sarma, Moumita and Das, Avishek and Gani, Md. Manjurul} } @conference {747, title = {A Method for Automatically Generating Schema Diagrams for OWL Ontologies}, booktitle = {1st Iberoamerican Knowledge Graph and Semantic Web Conference (KGSWC)}, year = {2019}, month = {06/2019}, publisher = {Springer}, organization = {Springer}, chapter = {149-161}, address = {Villa Clara, Cuba}, abstract = {

Interest in Semantic Web technologies, including knowledge graphs and ontologies, is increasing rapidly in industry and academics. In order to support ontology engineers and domain experts, it is necessary to provide them with robust tools that facilitate the ontology engineering process. Often, the schema diagram of an ontology is the most important tool for quickly conveying the overall purpose of an ontology. In this paper, we present a method for programmatically generating a schema diagram from an OWL file. We evaluate its ability to generate schema diagrams similar to manually drawn schema diagrams and show that it outperforms VOWL and OWLGrEd. In addition, we provide a prototype implementation of this tool.

}, keywords = {design patterns, evaluation, implementation, ontology, schema diagrams, visualization}, author = {Cogan Shimizu and Aaron Eberhart and Nazifa Karima and Quinn Hirt and Adila Krisnadhi and Pascal Hitzler} } @conference {758, title = {Tracking Human Behavioural Consistency by Analysing Periodicity of Household Water Consumption}, booktitle = {2nd International Conference on Sensors, Signal and Image Processing (SSIP 19)}, year = {2019}, publisher = {ACM}, organization = {ACM}, address = {Prague, Czech Republic}, abstract = {

People are living longer than ever due to advances in healthcare, and this has prompted many healthcare providers to look towards remote patient care as a means to meet the needs of the future. It is now a priority to enable people to reside in their own homes rather than in overburdened facilities whenever possible. The increasing maturity of IoT technologies and the falling costs of connected sensors has made the deployment of remote healthcare at scale an increasingly attractive prospect. In this work we demonstrate that we can measure the consistency and regularity of the behaviour of a household using sensor readings generated from interaction with the home environment. We show that we can track changes in this behaviour regularity longitudinally and detect changes that may be related to significant life events or trends that may be medically significant. We achieve this using periodicity analysis on water usage readings sampled from the main household water meter every 15 minutes for over 8 months. We utilise an IoT Application Enablement Platform in conjunction with low cost LoRa-enabled sensors and a Low Power Wide Area Network in order to validate a data collection methodology that could be deployed at large scale in future. We envision the statistical methods described here being applied to data streams from the homes of elderly and at-risk groups, both as a means of\  early illness\  detection\  and\  for\  monitoring\  the well-being of those with known illnesses.

}, keywords = {Ambient Assisted Living, Home Monitoring, Internet of Things, Sensor Applications, Sensor Networks}, author = {Quinn, Se{\'a}n and Murphy, Noel and Smeaton, Alan F.} } @article {890, title = {Machine learning for internet of things data analysis: a survey}, journal = {Digital Communications and Networks}, volume = {4}, year = {2018}, pages = {161-175}, abstract = {

Rapid developments in hardware, software, and communication technologies have facilitated the emergence of Internet-connected sensory devices that provide observations and data measurements from the physical world. By 2020, it is estimated that the total number of Internet-connected devices being used will be between 25 and 50 billion. As these numbers grow and technologies become more mature, the volume of data being published will increase. The technology of Internet-connected devices, referred to as Internet of Things (IoT), continues to extend the current Internet by providing connectivity and interactions between the physical and cyber worlds. In addition to an increased volume, the IoT generates big data characterized by its velocity in terms of time and location dependency, with a variety of multiple modalities and varying data quality. Intelligent processing and analysis of this big data are the key to developing smart IoT applications. This article assesses the various machine learning methods that deal with the challenges presented by IoT data by considering smart cities as the main use case. The key contribution of this study is the presentation of a taxonomy of machine learning algorithms explaining how different techniques are applied to the data in order to extract higher level information. The potential and challenges of machine learning for IoT data analytics will also be discussed. A use case of applying a Support Vector Machine (SVM) to Aarhus smart city traffic data is presented for a more detailed exploration.

}, keywords = {Internet of Things, Machine learning, Smart City, Smart data}, issn = {2352-8648}, doi = {https://doi.org/10.1016/j.dcan.2017.10.002}, url = {https://www.sciencedirect.com/science/article/pii/S235286481730247X}, author = {Mohammad Saeid Mahdavinejad and Mohammadreza Rezvan}, editor = {Mohammadamin Barekatain and Peyman Adibi and Payam Barnaghi and Amit P. Sheth} } @article {83, title = {Computational Complexity and Anytime Algorithm for Inconsistency Measurement}, journal = {International Journal of Software and Informatics}, volume = {4}, year = {2010}, pages = {3{\textendash}21}, abstract = {

Measuring inconsistency degrees of inconsistent knowledge bases is an important problem as it provides context information for facilitating inconsistency handling. Many methods have been proposed to solve this problem and a main class of them is based on some kind of paraconsistent semantics. In this paper, we consider the computational aspects of inconsistency degrees of propositional knowledge bases under 4-valued semantics. We first give a complete analysis of the computational complexity of computing inconsistency degrees. As it turns out that computing the exact inconsistency degree is intractable, we then propose an anytime algorithm that provides tractable approximations of the inconsistency degree from above and below. We show that our algorithm satisfies some desirable properties and give experimental results of our implementation of the algorithm

}, keywords = {algorithm, computational complexity, inconsistency measurement, Knowledge representation, multi-valued logic}, url = {http://www.ijsi.org/ch/reader/view_abstract.aspx?file_no=i41\&flag=1}, author = {Yue Ma and Guilin Qi and Guohui Xiao and Pascal Hitzler and Zuoquan Lin} } @article {80, title = {Concept learning in description logics using refinement operators}, journal = {Machine Learning}, volume = {78}, year = {2010}, pages = {203{\textendash}250}, abstract = {

With the advent of the Semantic Web, description logics have become one of the most prominent paradigms for knowledge representation and reasoning. Progress in research and applications, however, is constrained by the lack of well-structured knowledge bases consisting of a sophisticated schema and instance data adhering to this schema. It is paramount that suitable automated methods for their acquisition, maintenance, and evolution will be developed. In this paper, we provide a learning algorithm based on refinement operators for the description logic ALCQ including support for concrete roles. We develop the algorithm from thorough theoretical foundations by identifying possible abstract property combinations which refinement operators for description logics can have. Using these investigations as a basis, we derive a practically useful complete and proper refinement operator. The operator is then cast into a learning algorithm and evaluated using our implementation DL-Learner. The results of the evaluation show that our approach is superior to other learning approaches on description logics, and is competitive with established ILP systems.

}, keywords = {description logics, Inductive logic programming, OWL, refinement operators, Semantic Web, Structured Machine Learning}, url = {http://springerlink.metapress.com/content/c040n45u15qrnu44/}, author = {Jens Lehmann and Pascal Hitzler} }