Greece

Over the last years, Indoor Localization Systems (ILS) evolved, due to the inability of Global Positioning Systems (GPS) to localize in indoor environments. A variety of studies tackle indoor localization with technologies such as Bluetooth Beacons and RFID that require costly installation, or techniques such as Google Wi-Fi/Cell DB and fingerprinting that leverage from the already existing Wi-FI and telecommunication infrastructure. Additionally, recent studies attempt to solve the same problem using Bio-Inspired techniques, such as Artificial Neural Networks (ANNs) and Deep Neural Networks (DNN). In this paper, we introduce a Multi-Objective Optimization Radiomap Modelling (MOO-RM) based ILS. The MOO-RM ILS divides the dataset into clusters using a K-Means algorithm and trains ANN models on the data of each cluster. The resulting models are fed into a Multi-
Objective Evolutionary Algorithm based on Decomposition (MOEA/D), which minimizes the required storage space and the localization error, simultaneously. Our experimental studies demonstrate the superiority of athe proposed approach on real datasets of Wi-Fi traces with respect to various existing techniques.

AIAI 2020

Indoor Localization with Multi-Objective Selection of Radiomap Models

fingerprinting

smartphones

indoor localization

multi-objective optimization

artificial neural networks

AIAI 2020 (16th International Conference on Artificial Intelligence Applications and Innovations) should be held in Halkidiki, Greece. Due to current Covid-19 situation the conference will be held virtually. Underline will host a repository of video talks and preserve them for the future. Videos will be released on Underline one day after the conference.

technical paper

Autonomous driving is conducted in complex scenarios, which requires to detect 3D objects in real time scenarios as well as accurately track these 3D objects in order to get such information as location, size, trajectory, velocity. MOT (Multi-Object Tracking) performance is heavily dependent on object detection. Once object detection gives false alarms or missing alarms, the multi-object tracking would be automatically influenced. In this paper, we propose a coupling system which combines 3D object detection and multi-object tracking into one framework. We use the tracked objects as a reference in 3D object detection, in order to locate objects, reduce false or missing alarms in a single frame, and weaken the impact of false and missing alarms on the tracking quality. Our method is evaluated on KITTI dataset and is proved effective.

Robust 3D Detection in Traffic Scenario with Tracking-based Coupling System

In this paper, we present a novel method for jointly detecting and segmenting multiple objects from an untrimmed video. Unlike most existing video object segmentation methods that can only handle a trimmed video in which all video frames contain the target objects, we address a more practical and dicult problem, i.e., joint multi-object detection and segmentation from an untrimmed video where the target objects do not always appear per frame. In particular, our method consists of two modules, i.e., object decision module and object segmentation module. The object decision module is used to detect the objects and decide which target objects need to be separated out from video. As there are usually two or more target objects and they do not always appear in the whole video, we introduce the data association into object decision module to identify their correspondences among frames. The object segmentation module aims to separate the target objects identied by object decision module. In order to extensively evaluate the proposed method, we introduce a new dataset named UNVOSeg dataset, in which 7:2% of the video frames do not contain objects. Experimental results on four datasets demonstrate that our method outperforms most of the state-of-the-art approaches.

Joint Multi-Object Detection and Segmentation from an Untrimmed Video

Large ontologies are available as linked data, and they are used across many domains, but to process them considerable resources are required. RDF provides automation possibilities for semantic interpretation, which can lower the effort. We address the usage of RDF reasoning in large ontologies, and we test approaches for solving reasoning problems, having in mind use cases of low availability of computational resources. In our experiment, we designed and evaluated a method based on a reasoning problem of inferring Schema.org statements from cultural objects described in Wikidata. The method defines two intermediate tasks that reduce the volume of data used during the execution of the RDF reasoner, resulting in an efficient execution taking on average 10.3±7.6 milliseconds per RDF resource. The inferences obtained in the Wikidata test were analysed and found to be correct, and the computational resource requirements for reasoning were significantly reduced. Schema.org inference resulted in at least one rdf:type statement for each cultural resource, but the inference of Schema.org predicates was below expectations. Our experiment on cultural data has shown that Wikidata contains alignment statements to other ontologies used in the cultural domain, which with the application of RDF and OWL reasoning can be used to infer views of Wikidata expressed in cultural domain’s data models.

RDF reasoning on large ontologies: a study on cultural heritage and Wikidata

Brief Presentation of the problem dealt within eTracer. How we formed the knowledge and managed it along with relationships among concepts and how we applied spatio-temporal ruled-based reasoning on top. The presentation also involves examples of implicit relationships constructs, validations examples via SHACL, system-wise evaluation, a simulation example and concludes with future work and references.

Knowledge-base Management and Reasoning on Cultural and Natural Touristic Routes

Modelling of knowledge and actions in AI has advanced over the years but it is still a challenging topic due to the infamous frame problem, the inadequate formalization and the lack of automation. Some problems in cyber security such as logical vulnerability, risk assessment, policy validation etc. still require formal approach. In this presentation we present the foundations of a new formal framework to address these challenges. Our approach is based on three-level formalisation: ontological, logical and analytical levels. Here we are presenting the first two levels which allow to model the security policies and provide a practical solution to the frame problem by efficient utilization of parameters as side effects. Key concepts are the situations, actions, events and rules. Our framework has potential use for analysis of a wide range of transactional systems within the financial, commercial and business domains and further work will include analytical level where we can perform vulnerability analysis of the model.

Ontological Foundations of Modelling Security Policies for Logical Analytics

This work proposes an efficient Content-Based (CB) product recommendation
methodology that promotes diversity. A heuristic CB approach incor- AQ1
porating feature weighting and Locality-Sensitive Hashing (LSH) is used, along
with the TF-IDF method and functionality of tuning the importance of product
features to adjust its logic to the needs of various e-commerce sites. The problem
of efficiently producing recommendations, without compromising similarity,
is addressed by approximating product similarities via the LSH technique. The
methodology is evaluated on two sets with real e-commerce data. The evaluation
of the proposed methodology shows that the produced recommendations can
help customers to continue browsing a site by providing them with the necessary
“next step”. Finally, it is demonstrated that the methodology incorporates recommendation diversity which can be adjusted by tuning the appropriate feature
weights.

Promoting Diversity in Content Based Recommendation Using Feature Weighting and LSH

Existing approaches to automated opinion classification rely either on sentiment lexicons or supervised machine learning. Deep neural networks perform this classification task particularly well by utilizing dense document representation in terms of word embeddings. However, this representation model does not consider the sentiment polarity or sentiment intensity of the words. To overcome this problem, we propose a novel model of deep neural network with word-sentiment associations. This model produces richer document representation that incorporates both word context and word sentiment. Specifically, our model utilizes pre-trained word embeddings and lexicon-based sentiment indicators to provide inputs to a deep feed-forward neural network. To verify the effectiveness of the proposed model, a benchmark dataset of Amazon reviews is used.

Opinion Mining of Consumer Reviews Using Deep Neural Networks with Word-Sentiment Associations

In recent years, many models for predicting movie ratings have been pro-posed, focusing on utilizing movie reviews combined with sentiment lexicons. In this study, we offer a different approach based on the combination of the emotionally analyzed movie script and their respective reviews. The logic behind this model is that if the emotional experience described by the reviewer match or clash with the emotions expressed in the movie script, then this correlation will be reflected in the particular rating of the movie. We collected a dataset consisting of 747 movie scripts and 78k reviews and recreated many conventional approaches for movie rating pre-diction, including Vector Semantics and Sentiment Analysis techniques ran with a variety of Machine Learning algorithms, in order to more accurately evaluate the performance of our model and validity of our hypothesis. Our results indicate that a possible combination of sentiment lexicons can achieve impressive performances, while other combinations produce a variety of outcomes.

Sentiment Analysis on Movie Scripts and Reviews

Sentiment analysis is a vigorous research area, with many application domains. In this work, aspect-based sentiment prediction is examined as a component of a larger architecture that crawls, indexes and stores documents from a wide variety of online sources, including the most popular social networks. The textual part of the collected information is processed by a hybrid bi-directional long short-term memory architecture, coupled with convolutional layers along with an attention mechanism. The extracted textual features are then combined with other characteristics, such as the number of repetitions, the type and frequency of emoji ideograms in a fully-connected, feed-forward artificial neural network that performs the final prediction task. The obtained results, especially for the negative sentiment class, which is of particular importance in certain cases, are encouraging, underlying the robustness of the proposed approach.

A deep learning approach to aspect-based sentiment prediction

Therefore, in this paper, we propose a dynamic optimization scheme for the edge computing system with multiple mobile devices (MDs), where the radio and computational resources, and ofﬂoading decisions, can be dynamically coordinated and allocated with the variation of radio resources and computation demands. Speciﬁcally, with the objective to minimize the system cost related to latency, energy consumption and weights of MDs, we propose a joint computation ofﬂoading and radio resource allocation algorithm based on Lyapunov optimization.

Downloads

Next from AIAI 2020

Robust 3D Detection in Traffic Scenario with Tracking-based Coupling System

Similar lecture

Tensor-based CUDA Optimization for ANN Inferencing using Parallel Acceleration on Embedded GPU

.css-70qvj9{display:-webkit-box;display:-webkit-flex;display:-ms-flexbox;display:flex;-webkit-align-items:center;-webkit-box-align:center;-ms-flex-align:center;align-items:center;}Downloads

Next from AIAI 2020

Robust 3D Detection in Traffic Scenario with Tracking-based Coupling System

Similar lecture

Tensor-based CUDA Optimization for ANN Inferencing using Parallel Acceleration on Embedded GPU

Downloads