2020
Authors
Veloso, B; Malheiro, B; Burguillo, JC; Gama, J;
Publication
PAAMS
Abstract
This paper analyses the impact of trust and reputation modelling on CloudAnchor, a business-to-business brokerage platform for the transaction of single and federated resources on behalf of Small and Medium Sized Enterprises (SME). In CloudAnchor, businesses act as providers or consumers of Infrastructure as a Service (IaaS) resources. The platform adopts a multi-layered multi-agent architecture, where providers, consumers and virtual providers, representing provider coalitions, engage in trust & reputation-based provider look-up, invitation, acceptance and resource negotiations. The goal of this work is to assess the relevance of the distributed trust model and centralised fuzzified reputation service in the number of resources successfully transacted, the global turnover, brokerage fees, losses, expenses and time response. The results show that trust and reputation based brokerage has a positive impact on the CloudAnchor performance by reducing losses and the execution time for the provision of both single and federated resources and increasing considerably the number of federated resources provided.
2020
Authors
Bardhan, R; Debnath, R; Gama, J; Vijay, U;
Publication
SUSTAINABLE CITIES AND SOCIETY
Abstract
Future cities of the Global South will not only rapidly urbanise but will also get warmer from climate change and urbanisation induced effects. It will trigger a multi-fold increase in cooling demand, especially at a residential level, mitigation to which remains a policy and research gap. This study forwards a novel residential energy stress mitigation framework called REST to estimate warming climate-induced energy stress in residential buildings using a GIS-driven urban heat island and energy modelling approach. REST further estimates rooftop solar potential to enable solar photo-voltaic (PV) based decentralised energy solutions and establish an optimised routine for peer-to-peer energy sharing at a neighbourhood scale. The optimised network is classified through a decision tree algorithm to derive sustainability rules for mitigating energy stress at an urban planning scale. These sustainability rules established distributive energy justice variables in urban planning context. The REST framework is applied as a proof-of-concept on a future smart city of India, named Amaravati. Results show that cooling energy stress can be reduced by 80 % in the study area through sensitive use of planning variables like Floor Space Index (FSI) and built-up density. It has crucial policy implications towards the design and implementation of a national level cooling action plans in the future cities of the Global South to meet the UN-SDG - 7 (clean and affordable energy) and SDG - 11 (sustainable cities and communities) targets.
2019
Authors
Costa, JD; Faria, ER; Silva, JA; Gama, J; Cerri, R;
Publication
2019 INTERNATIONAL JOINT CONFERENCE ON NEURAL NETWORKS (IJCNN)
Abstract
In multi-label classification problems an example can be simultaneously classified into more than one class. This is also a challenging task in Data Streams (DS) classification, where unbounded and non-stationary distributed multi-label data contain multiple concepts that drift at different rates and patterns. In addition, the true labels of the examples may never become available and updating classification models in a supervised fashion is unfeasible. In this paper, we propose a Multi-Label Stream Classification (MLSC) method applying a Novelty Detection (ND) procedure task to update the classification model detecting any new patterns in the examples, which differ in some aspects from observed patterns, in an unsupervised fashion without any external feedback. Although ND is suitable for multi-class stream classification, it is still a not well-investigated task for multi-label problems. We improve a initial work proposed in [1] and extended it with a new Pruned Sets (PS) transformation strategy. The experiments showed that our method presents competitive performances over data sets with different concept drifts, and outperform, in some aspects, the baseline methods.
2020
Authors
Pinagé, F; dos Santos, EM; Gama, J;
Publication
DATA MINING AND KNOWLEDGE DISCOVERY
Abstract
Machine learning algorithms can be applied to several practical problems, such as spam, fraud and intrusion detection, and customer preferences, among others. In most of these problems, data come in streams, which mean that data distribution may change over time, leading to concept drift. The literature is abundant on providing supervised methods based on error monitoring for explicit drift detection. However, these methods may become infeasible in some real-world applications-where there is no fully labeled data available, and may depend on a significant decrease in accuracy to be able to detect drifts. There are also methods based on blind approaches, where the decision model is updated constantly. However, this may lead to unnecessary system updates. In order to overcome these drawbacks, we propose in this paper a semi-supervised drift detector that uses an ensemble of classifiers based on self-training online learning and dynamic classifier selection. For each unknown sample, a dynamic selection strategy is used to choose among the ensemble's component members, the classifier most likely to be the correct one for classifying it. The prediction assigned by the chosen classifier is used to compute an estimate of the error produced by the ensemble members. The proposed method monitors such a pseudo-error in order to detect drifts and to update the decision model only after drift detection. The achievement of this method is relevant in that it allows drift detection and reaction and is applicable in several practical problems. The experiments conducted indicate that the proposed method attains high performance and detection rates, while reducing the amount of labeled data used to detect drift.
2020
Authors
Tisljaric, L; Fernandes, S; Caric, T; Gama, J;
Publication
DS
Abstract
Tensor-based models emerged only recently in modeling and analysis of the spatiotemporal road traffic data. They outperform other data models regarding the property of simultaneously capturing both spatial and temporal components of the observed traffic dataset. In this paper, the nonnegative tensor decomposition method is used to extract traffic patterns in the form of Speed Transition Matrix (STM). The STM is presented as the approach for modeling the large sparse Floating Car Data (FCD). The anomaly of the traffic pattern is estimated using Kullback–Leibler divergence between the observed traffic pattern and the average traffic pattern. Experiments were conducted on the large sparse FCD dataset for the most relevant road segments in the City of Zagreb, which is the capital and largest city in Croatia. Results show that the method was able to detect the most anomalous traffic road segments, and with analysis of the extracted spatial and temporal components, conclusions could be drawn about the causes of the anomalies. Results are validated by using the domain knowledge from the Highway Capacity Manual and achieved a precision score value of more than 90%. Therefore, such valuable traffic information can be used in routing applications and urban traffic planning.
2016
Authors
Vinagre, J; Jorge, AM; Gama, J;
Publication
STREAMEVOLV@ECML-PKDD
Abstract
Online recommender systems often deal with continuous, potentially fast and unbounded ows of data. Ensemble methods for recommender systems have been used in the past in batch algorithms, however they have never been studied with incremental algorithms, that are capable of processing those data streams on the y. We propose online bagging, using an incremental matrix factorization algorithm for positiveonly data streams. Using prequential evaluation, we show that bagging is able to improve accuracy more than 20% over the baseline with small computational overhead.
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.