Incremental Computation of Deterministic Extensions for Dynamic Argumentation Frameworks

Author(s):  
Sergio Greco ◽  
Francesco Parisi
Author(s):  
Yu Chen ◽  
Yong Zhang ◽  
Jin Wang ◽  
Jiacheng Wu ◽  
Chunxiao Xing

2015 ◽  
Vol 50 (10) ◽  
pp. 748-766 ◽  
Author(s):  
Matthew A. Hammer ◽  
Joshua Dunfield ◽  
Kyle Headley ◽  
Nicholas Labich ◽  
Jeffrey S. Foster ◽  
...  

Author(s):  
Guozhu Dong ◽  
Jianwen Su

2018 ◽  
pp. 1830-1833
Author(s):  
Guozhu Dong ◽  
Jianwen Su

Author(s):  
Daphne Odekerken ◽  
Floris Bex

We propose an agent architecture for transparent human-in-the-loop classification. By combining dynamic argumentation with legal case-based reasoning, we create an agent that is able to explain its decisions at various levels of detail and adapts to new situations. It keeps the human analyst in the loop by presenting suggestions for corrections that may change the factors on which the current decision is based and by enabling the analyst to add new factors. We are currently implementing the agent for classification of fraudulent web shops at the Dutch Police.


Author(s):  
M. Julieta Marcos ◽  
Marcelo A. Falappa ◽  
Guillermo R. Simari

2020 ◽  
Vol 14 (3) ◽  
pp. 294-306
Author(s):  
Mourad Khayati ◽  
Ines Arous ◽  
Zakhar Tymchenko ◽  
Philippe Cudré-Mauroux

With the emergence of the Internet of Things (IoT), time series streams have become ubiquitous in our daily life. Recording such data is rarely a perfect process, as sensor failures frequently occur, yielding occasional blocks of data that go missing in multiple time series. These missing blocks do not only affect real-time monitoring but also compromise the quality of online data analyses. Effective streaming recovery (imputation) techniques either have a quadratic runtime complexity, which is infeasible for any moderately sized data, or cannot recover more than one time series at a time. In this paper, we introduce a new online recovery technique to recover multiple time series streams in linear time. Our recovery technique implements a novel incremental version of the Centroid Decomposition technique and reduces its complexity from quadratic to linear. Using this incremental technique, missing blocks are efficiently recovered in a continuous manner based on previous recoveries. We formally prove the correctness of our new incremental computation, which yields an accurate recovery. Our experimental results on real-world time series show that our recovery technique is, on average, 30% more accurate than the state of the art while being vastly more efficient.


Author(s):  
Maximiliano Sapino ◽  
Edgardo Ferretti ◽  
Luciana Mariñelarena Dondena ◽  
Marcelo Errecalde

Sign in / Sign up

Export Citation Format

Share Document