2019
Authors
Adao, T; Padua, L; Narciso, D; Sousa, JJ; Agrellos, L; Peres, E; Magalhaes, L;
Publication
JOURNAL OF INFORMATION TECHNOLOGY RESEARCH
Abstract
MixAR, a full-stack system capable of providing visualization of virtual reconstructions seamlessly integrated in the real scene (e.g. upon ruins), with the possibility of being freely explored by visitors, in situ, is presented in this article. In addition to its ability to operate with several tracking approaches to be able to deal with a wide variety of environmental conditions, MixAR system also implements an extended environment feature that provides visitors with an insight on surrounding points-of-interest for visitation during mixed reality experiences (positional rough tracking). A procedural modelling tool mainstreams augmentation models production. Tests carried out with participants to ascertain comfort, satisfaction and presence/immersion based on an in-field MR experience and respective results are also presented. Ease to adapt to the experience, desire to see the system in museums and a raised curiosity and motivation contributed as positive points for evaluation. In what regards to sickness and comfort, the lowest number of complaints seems to be satisfactory. Models' illumination/re-lightning must be addressed in the future to improve the user's engagement with the experiences provided by the MixAR system.
2019
Authors
Cordeiro, M; Sarmento, RP; Brazdil, P; Kimura, M; Gama, J;
Publication
Complex Networks and Their Applications VIII - Volume 1 Proceedings of the Eighth International Conference on Complex Networks and Their Applications COMPLEX NETWORKS 2019, Lisbon, Portugal, December 10-12, 2019.
Abstract
Discovering communities in a network is a fundamental and important problem to complex networks. Find the most influential actors among its peers is a major task. If on one side, studies on community detection ignore the influence of actors and communities, on the other hand, ignoring the hierarchy and community structure of the network neglect the actor or community influence. We bridge this gap by combining a dynamic community detection method with a dynamic centrality measure. The proposed enhanced dynamic hierarchical community detection method computes centrality for nodes and aggregated communities and selects each community representative leader using the ranked centrality of every node belonging to the community. This method is then able to unveil, track, and measure the importance of main actors, network intra and inter-community structural hierarchies based on a centrality measure. The empirical analysis performed, using two temporal networks shown that the method is able to find and tracking community leaders in evolving networks. © 2020, Springer Nature Switzerland AG.
2019
Authors
Li, G; Yang, J; Gama, J; Natwichai, J; Tong, Y;
Publication
DASFAA Workshops
Abstract
2019
Authors
Faia, R; Pinto, T; Vale, ZA;
Publication
Progress in Artificial Intelligence - 19th EPIA Conference on Artificial Intelligence, EPIA 2019, Vila Real, Portugal, September 3-6, 2019, Proceedings, Part I
Abstract
2019
Authors
Rivolli, A; Amaral, C; Guardão, L; de Sá, CR; Soares, C;
Publication
Discovery Science - 22nd International Conference, DS 2019, Split, Croatia, October 28-30, 2019, Proceedings
Abstract
Chatbots have been used in business contexts as a new way of communicating with customers. They use natural language to interact with the customers, whether while offering products and services, or in the support of a specific task. In this context, an important and challenging task is to assess the effectiveness of the machine-to-human interaction, according to business’ goals. Although several analytic tools have been proposed to analyze the user interactions with chatbot systems, to the best of our knowledge they do not consider user-defined criteria, focusing on metrics of engagement and retention of the system as a whole. For this reason, we propose the KnowBots tool, which can be used to discover relevant patterns in the dialogues of chatbots, by considering specific business goals. Given the non-trivial structure of dialogues and the possibly large number of conversational records, we combined sequential pattern mining and subgroup discovery techniques to identify patterns of usage. Moreover, a friendly user-interface was developed to present the results and to allow their detailed analysis. Thus, it may serve as an alternative decision support tool for business or any entity that makes use of this type of interactions with their clients. © Springer Nature Switzerland AG 2019.
2019
Authors
Veloso, B; Martins, C; Espanha, R; Azevedo, R; Gama, J;
Publication
Proceedings of the 8th International Workshop on Big Data, IoT Streams and Heterogeneous Source Mining: Algorithms, Systems, Programming Models and Applications co-located with 25th ACM SIGKDD Conference on Knowledge Discovery and Data Mining (KDD 2019), Anchorage, Alaska, August 4-8, 2019.
Abstract
The high asymmetry of international termination rates, where calls are charged with higher values, are fertile ground for the appearance of frauds in Telecom Companies. In this paper, we present a solution for a real problem called Interconnect Bypass Fraud. This problem is one of the most expressive in the telecommunication domain and can be detected by the occurrence of burst of calls from specific numbers. Based on this assumption, we propose the adoption of a new fast forgetting technique that works together with the Lossy Counting algorithm. Our goal is to detect as soon as possible items with abnormal behaviours, e.g. bursts of calls, repetitions and mirror behaviours. The results shows that our technique not only complements the techniques used by the telecom company but also improves the performance of the Lossy Counting algorithm in terms of runtime, memory used and sensibility to detect the abnormal behaviours. Copyright © by the paper's authors. Use permitted under Creative Commons License Attribution 4.0 International (CC BY 4.0).
The access to the final selection minute is only available to applicants.
Please check the confirmation e-mail of your application to obtain the access code.