An Efficient Pruning and Filtering Strategy to Mine Partial Periodic Patterns from a Sequence of Event Sets

2014 ◽  
Vol 10 (2) ◽  
pp. 18-38 ◽  
Author(s):  
Kung-Jiuan Yang ◽  
Tzung-Pei Hong ◽  
Yuh-Min Chen ◽  
Guo-Cheng Lan
Keyword(s):  
Time Series ◽  
Real World ◽  
Oil Price ◽  
Time Stamp ◽  
Single Event ◽  
Periodic Patterns ◽  
Event Time ◽  
The Past ◽  
Real World Applications ◽  
Speed Up

Partial periodic patterns are commonly seen in real-world applications. The major problem of mining partial periodic patterns is the efficiency problem due to a huge set of partial periodic candidates. Although some efficient algorithms have been developed to tackle the problem, the performance of the algorithms significantly drops when the mining parameters are set low. In the past, the authors have adopted the projection-based approach to discover the partial periodic patterns from single-event time series. In this paper, the authors extend it to mine partial periodic patterns from a sequence of event sets which multiple events concurrently occur at the same time stamp. Besides, an efficient pruning and filtering strategy is also proposed to speed up the mining process. Finally, the experimental results on a synthetic dataset and real oil price dataset show the good performance of the proposed approach.

Against generalisation: Data-driven decisions need context to be human-compatible

2021 ◽  
pp. 026638212110619
Author(s):  
Sharon Richardson
Keyword(s):  
Artificial Intelligence ◽  
Real World ◽  
Data Science ◽  
Machine Learning Algorithms ◽  
Data Driven ◽  
Theoretical Frameworks ◽  
The Past ◽  
Real World Applications ◽  
Contextual Framework ◽  
Data Driven Decisions

During the past two decades, there have been a number of breakthroughs in the fields of data science and artificial intelligence, made possible by advanced machine learning algorithms trained through access to massive volumes of data. However, their adoption and use in real-world applications remains a challenge. This paper posits that a key limitation in making AI applicable has been a failure to modernise the theoretical frameworks needed to evaluate and adopt outcomes. Such a need was anticipated with the arrival of the digital computer in the 1950s but has remained unrealised. This paper reviews how the field of data science emerged and led to rapid breakthroughs in algorithms underpinning research into artificial intelligence. It then discusses the contextual framework now needed to advance the use of AI in real-world decisions that impact human lives and livelihoods.

scholarly journals INDUSTRIAL APPLICATIONS OF ARTIFICIAL NEURAL NETWORKS

2014 ◽  
pp. 8-20
Author(s):  
Kurosh Madani
Keyword(s):  
Neural Networks ◽  
Artificial Neural Networks ◽  
Real World ◽  
Industrial Applications ◽  
Large Field ◽  
Nonlinear Functions ◽  
The Past ◽  
Real World Applications ◽  
Ann Models ◽  
Artificial Neural

In a large number of real world dilemmas and related applications the modeling of complex behavior is the central point. Over the past decades, new approaches based on Artificial Neural Networks (ANN) have been proposed to solve problems related to optimization, modeling, decision making, classification, data mining or nonlinear functions (behavior) approximation. Inspired from biological nervous systems and brain structure, Artificial Neural Networks could be seen as information processing systems, which allow elaboration of many original techniques covering a large field of applications. Among their most appealing properties, one can quote their learning and generalization capabilities. The main goal of this paper is to present, through some of main ANN models and based techniques, their real application capability in real world industrial dilemmas. Several examples through industrial and real world applications have been presented and discussed.

scholarly journals Sliding-Window Thompson Sampling for Non-Stationary Settings

2020 ◽  
Vol 68 ◽  
pp. 311-364
Author(s):  
Francesco Trovo ◽  
Stefano Paladino ◽  
Marcello Restelli ◽  
Nicola Gatti
Keyword(s):  
Real World ◽  
State Of The Art ◽  
Sliding Window ◽  
Upper Bounds ◽  
Decision Problems ◽  
Sequential Decision ◽  
Thompson Sampling ◽  
The Past ◽  
Real World Applications ◽  
Window Approach

Multi-Armed Bandit (MAB) techniques have been successfully applied to many classes of sequential decision problems in the past decades. However, non-stationary settings -- very common in real-world applications -- received little attention so far, and theoretical guarantees on the regret are known only for some frequentist algorithms. In this paper, we propose an algorithm, namely Sliding-Window Thompson Sampling (SW-TS), for nonstationary stochastic MAB settings. Our algorithm is based on Thompson Sampling and exploits a sliding-window approach to tackle, in a unified fashion, two different forms of non-stationarity studied separately so far: abruptly changing and smoothly changing. In the former, the reward distributions are constant during sequences of rounds, and their change may be arbitrary and happen at unknown rounds, while, in the latter, the reward distributions smoothly evolve over rounds according to unknown dynamics. Under mild assumptions, we provide regret upper bounds on the dynamic pseudo-regret of SW-TS for the abruptly changing environment, for the smoothly changing one, and for the setting in which both the non-stationarity forms are present. Furthermore, we empirically show that SW-TS dramatically outperforms state-of-the-art algorithms even when the forms of non-stationarity are taken separately, as previously studied in the literature.

PROVIDING TIMELY UPDATED SEQUENTIAL PATTERNS IN DECISION MAKING

2010 ◽  
Vol 09 (06) ◽  
pp. 873-888 ◽  
Author(s):  
TZUNG-PEI HONG ◽  
CHING-YAO WANG ◽  
CHUN-WEI LIN
Keyword(s):  
Decision Making ◽  
Real Time ◽  
Real World ◽  
Experimental Results ◽  
Sequential Patterns ◽  
The Past ◽  
Large Databases ◽  
Real World Applications ◽  
Critical Task ◽  
Maintenance Process

Mining knowledge from large databases has become a critical task for organizations. Managers commonly use the obtained sequential patterns to make decisions. In the past, databases were usually assumed to be static. In real-world applications, however, transactions may be updated. In this paper, a maintenance algorithm for rapidly updating sequential patterns for real-time decision making is proposed. The proposed algorithm utilizes previously discovered large sequences in the maintenance process, thus greatly reducing the number of database rescans and improving performance. Experimental results verify the performance of the proposed approach. The proposed algorithm provides real-time knowledge that can be used for decision making.

Efficient Mining of Partial Periodic Patterns with Individual Event Support Thresholds Using Minimum Constraints

2014 ◽  
Vol 22 (06) ◽  
pp. 793-814
Author(s):  
Kung-Jiuan Yang ◽  
Tzung-Pei Hong ◽  
Guo-Cheng Lan ◽  
Yuh-Min Chen
Keyword(s):  
Real World ◽  
Execution Time ◽  
Real Life ◽  
Individual Event ◽  
Periodic Patterns ◽  
Minimum Support ◽  
Real World Applications ◽  
Support Threshold ◽  
Multiple Minimum Supports ◽  
Minimum Constraints

Partial periodic patterns are commonly seen in real-life applications and provide useful prediction with uncertainty. Most previous approaches have set a single minimum support threshold for all events to assume they have similar frequencies which is not practical for real-world applications. Instead of setting a single minimum support threshold for all events, Chen et al. proposed an FP-tree-like algorithm to allow multiple minimum supports for reflecting the natures of the events. However, such a tree-based algorithm encountered an efficiency problem while period length is long or event sequential orders in period segments are varied. Under the circumstance, many tree branches are created and much execution time is spent to find partial periodic patterns. In this paper, we thus propose a projection-based algorithm which examines only prefix subsequences and projects only corresponding postfix subsequences with multiple minimum supports to quickly find the partial periodic patterns in a recursive process. Experiments on both synthetic and real-life datasets show that the proposed algorithm is more efficient than the previous one.

scholarly journals On the Behaviour of Weighted Permutation Entropy on Fractional Brownian Motion in the Univariate and Multivariate Setting

2021 ◽  
Vol 34 (1) ◽  
Author(s):  
Marisa Mohr ◽  
Florian Wilhelm ◽  
Ralf Möller
Keyword(s):  
Time Series ◽  
Brownian Motion ◽  
Fractional Brownian Motion ◽  
Real World ◽  
Multivariate Time Series ◽  
Permutation Entropy ◽  
Qualitative Behaviour ◽  
Univariate Time Series ◽  
Real World Applications ◽  
Real World Problems

The estimation of the qualitative behaviour of fractional Brownian motion is an important topic for modelling real-world applications. Permutation entropy is a well-known approach to quantify the complexity of univariate time series in a scalar-valued representation. As an extension often used for outlier detection, weighted permutation entropy takes amplitudes within time series into account. As many real-world problems deal with multivariate time series, these measures need to be extended though. First, we introduce multivariate weighted permutation entropy, which is consistent with standard multivariate extensions of permutation entropy. Second, we investigate the behaviour of weighted permutation entropy on both univariate and multivariate fractional Brownian motion and show revealing results.

From Single Biometrics to Multi-Biometrics

2011 ◽  
pp. 254-272
Author(s):  
David Zhang ◽  
Fengxi Song ◽  
Yong Xu ◽  
Zhizhen Liang
Keyword(s):  
Performance Evaluation ◽  
Research And Development ◽  
Real World ◽  
System Performance ◽  
Biometric System ◽  
The Past ◽  
Biometric Systems ◽  
Real World Applications ◽  
Biometric Trait

In the past decades while biometrics attracts increasing attention of researchers, people also have found that the biometric system using a single biometric trait may not satisfy the demand of some real-world applications. Diversity of biometric traits also means that they may have different performance such as accuracy and reliability. Multi-biometric applications emerging in recent years are a big progress of biometrics. They can overcome some shortcomings of the single biometric system and can perform well in improving the system performance. In this chapter we describe a number of definitions on biometrics, categories and fusion strategies of multi-biometrics as well as the performance evaluation on the biometric system. The first section of this chapter describes some concepts, motivation and justification of multi-biometrics. Section 12.2 provides some definitions and notations of biometric and multi-biometric technologies. Section 12.3 is mainly related to performance evaluation of various types of biometric systems. Section 12.4 briefly presents research and development of multi-biometrics.

scholarly journals Modular Self-Reconfigurable Robotic Systems: A Survey on Hardware Architectures

2017 ◽  
Vol 2017 ◽  
pp. 1-19 ◽  
Author(s):  
S. Sankhar Reddy Chennareddy ◽  
Anita Agrawal ◽  
Anupama Karuppiah
Keyword(s):  
Real World ◽  
Consumer Products ◽  
Robotic Systems ◽  
Modular Robots ◽  
Self Healing ◽  
Utilization Factor ◽  
The Past ◽  
Reconfigurable Robots ◽  
Real World Applications ◽  
Hardware Architectures

Modular self-reconfigurable robots present wide and unique solutions for growing demands in the domains of space exploration, automation, consumer products, and so forth. The higher utilization factor and self-healing capabilities are most demanded traits in robotics for real world applications and modular robotics offer better solutions in these perspectives in relation to traditional robotics. The researchers in robotics domain identified various applications and prototyped numerous robotic models while addressing constraints such as homogeneity, reconfigurability, form factor, and power consumption. The diversified nature of various modular robotic solutions proposed for real world applications and utilization of different sensor and actuator interfacing techniques along with physical model optimizations presents implicit challenges to researchers while identifying and visualizing the merits/demerits of various approaches to a solution. This paper attempts to simplify the comparison of various hardware prototypes by providing a brief study on hardware architectures of modular robots capable of self-healing and reconfiguration along with design techniques adopted in modeling robots, interfacing technologies, and so forth over the past 25 years.

scholarly journals Praise from a self-enhancement perspective: More, I want more?

2020 ◽  
Author(s):  
Frederik Anseel ◽  
Elena Martinescu
Keyword(s):  
Real World ◽  
Self Evaluation ◽  
The Past ◽  
Real World Applications ◽  
Human Need ◽  
And Behavior ◽  
Theoretical Issues

Positive self-evaluation is a fundamental human need, enabling individuals to face challenges or pursue new opportunities in their environment. In the past decades, several lines of research have provided support for the overpowering effect of self-enhancement motivation in directing individuals’ attention and behavior relative to other self-evaluation motives. In the current chapter, we briefly summarize the basics of self-enhancement theory, how it has helped understand the psychology of praise and how some long-standing theoretical debates have been solved. In the second part, we review new theoretical issues that have emerged in recent years, summarize new manifestations of self-enhancement in the study of praise and 'real-world' applications of these insights.

Sign in / Sign up

Export Citation Format

Share Document