scholarly journals An Algorithm for Mining High Utility Sequential Patterns with Time Interval

2019 ◽  
Vol 19 (4) ◽  
pp. 3-16
Author(s):  
Tran Huy Duong ◽  
Demetrovics Janos ◽  
Vu Duc Thi ◽  
Nguyen Truong Thang ◽  
Tran The Anh
Keyword(s):  
Sequential Patterns ◽  
Time Constraints ◽  
Time Interval ◽  
Sequence Database ◽  
Utility Value ◽  
Time Intervals ◽  
Real World Applications ◽  
High Utility ◽  
Downward Closure ◽  
Mining Algorithms

Abstract Mining High Utility Sequential Patterns (HUSP) is an emerging topic in data mining which attracts many researchers. The HUSP mining algorithms can extract sequential patterns having high utility (importance) in a quantitative sequence database. In real world applications, the time intervals between elements are also very important. However, recent HUSP mining algorithms cannot extract sequential patterns with time intervals between elements. Thus, in this paper, we propose an algorithm for mining high utility sequential patterns with the time interval problem. We consider not only sequential patterns’ utilities, but also their time intervals. The sequence weight utility value is used to ensure the important downward closure property. Besides that, we use four time constraints for dealing with time interval in the sequence to extract more meaningful patterns. Experimental results show that our proposed method is efficient and effective in mining high utility sequential pattern with time intervals.

Mining Time-Interval Sequential Patterns with High Utility from Transaction Databases

2016 ◽  
Vol 20 (6) ◽  
pp. 1018-1026 ◽  
Author(s):  
Wen-Yen Wang ◽  
◽  
Anna Y.-Q. Huang ◽  
Keyword(s):  
Pattern Mining ◽  
Sequential Pattern Mining ◽  
Business Practice ◽  
Sequential Pattern ◽  
Sequential Patterns ◽  
Time Interval ◽  
Business Managers ◽  
Time Intervals ◽  
High Utility ◽  
Product Sales

The purpose of time-interval sequential pattern mining is to help superstore business managers promote product sales. Sequential pattern mining discovers the time interval patterns for items: for example, if most customers purchase product item <span class="bold">A</span>, and then buy items <span class="bold">B</span> and <span class="bold">C</span> after <span class="bold">r</span> to <span class="bold">s</span> and <span class="bold">t</span> to <span class="bold">u</span> days respectively, the time interval between <span class="bold">r</span> to <span class="bold">s</span> and <span class="bold">t</span> to <span class="bold">u</span> days can be provided to business managers to facilitate informed marketing decisions. We treat these time intervals as patterns to be mined, to predict the purchasing time intervals between <span class="bold">A</span> and <span class="bold">B</span>, as well as <span class="bold">B</span> and <span class="bold">C</span>. Nevertheless, little work considers the significance of product items while mining these time-interval sequential patterns. This work extends previous work and retains high-utility time interval patterns during pattern mining. This type of mining is meant to more closely reflect actual business practice. Experimental results show the differences between three mining approaches when jointly considering item utility and time intervals for purchased items. In addition to yielding more accurate patterns than the other two methods, the proposed UTMining_A method shortens execution times by delaying join processing and removing unnecessary records.

scholarly journals HIGH UTILITY ITEM INTERVAL SEQUENTIAL PATTERN MINING ALGORITHM

2020 ◽  
Vol 36 (1) ◽  
pp. 1-15
Author(s):  
Tran Huy Duong ◽  
Nguyen Truong Thang ◽  
Vu Duc Thi ◽  
Tran The Anh
Keyword(s):  
Data Mining ◽  
Pattern Mining ◽  
Sequential Pattern Mining ◽  
Sequential Pattern ◽  
Sequential Patterns ◽  
Sequence Database ◽  
Mining Algorithm ◽  
Pattern Growth ◽  
High Utility ◽  
Growth Approach

High utility sequential pattern mining is a popular topic in data mining with the main purpose is to extract sequential patterns with high utility in the sequence database. Many recent works have proposed methods to solve this problem. However, most of them does not consider item intervals of sequential patterns which can lead to the extraction of sequential patterns with too long item interval, thus making little sense. In this paper, we propose a High Utility Item Interval Sequential Pattern (HUISP) algorithm to solve this problem. Our algorithm uses pattern growth approach and some techniques to increase algorithm's performance.

scholarly journals HIGH UTILITY ITEM INTERVAL SEQUENTIAL PATTERN MINING ALGORITHM

2020 ◽  
Vol 36 (1) ◽  
pp. 1-15
Author(s):  
Tran Huy Duong ◽  
Nguyen Truong Thang ◽  
Vu Duc Thi ◽  
Tran The Anh
Keyword(s):  
Data Mining ◽  
Pattern Mining ◽  
Sequential Pattern Mining ◽  
Sequential Pattern ◽  
Sequential Patterns ◽  
Sequence Database ◽  
Mining Algorithm ◽  
Pattern Growth ◽  
High Utility ◽  
Growth Approach

High utility sequential pattern mining is a popular topic in data mining with the main purpose is to extract sequential patterns with high utility in the sequence database. Many recent works have proposed methods to solve this problem. However, most of them does not consider item intervals of sequential patterns which can lead to the extraction of sequential patterns with too long item interval, thus making little sense. In this paper, we propose a High Utility Item Interval Sequential Pattern (HUISP) algorithm to solve this problem. Our algorithm uses pattern growth approach and some techniques to increase algorithm's performance.

METABOLIC STUDIES WITH 131I-LABELED THYROXINE. II.

1963 ◽  
Vol 44 (3) ◽  
pp. 475-480 ◽  
Author(s):  
R. Grinberg
Keyword(s):  
Spinal Cord ◽  
Central Nervous System ◽  
Nervous System ◽  
Optic Nerve ◽  
Pituitary Gland ◽  
Time Interval ◽  
Time Intervals ◽  
Pituitary Glands ◽  
The Central Nervous System ◽  
Tentative Explanation

ABSTRACT Radiologically thyroidectomized female Swiss mice were injected intraperitoneally with 131I-labeled thyroxine (T4*), and were studied at time intervals of 30 minutes and 4, 28, 48 and 72 hours after injection, 10 mice for each time interval. The organs of the central nervous system and the pituitary glands were chromatographed, and likewise serum from the same animal. The chromatographic studies revealed a compound with the same mobility as 131I-labeled triiodothyronine in the organs of the CNS and in the pituitary gland, but this compound was not present in the serum. In most of the chromatographic studies, the peaks for I, T4 and T3 coincided with those for the standards. In several instances, however, such an exact coincidence was lacking. A tentative explanation for the presence of T3* in the pituitary gland following the injection of T4* is a deiodinating system in the pituitary gland or else the capacity of the pituitary gland to concentrate T3* formed in other organs. The presence of T3* is apparently a characteristic of most of the CNS (brain, midbrain, medulla and spinal cord); but in the case of the optic nerve, the compound is not present under the conditions of this study.

scholarly journals Neural Network Approach for Global Solar Irradiance Prediction at Extremely Short-Time-Intervals Using Particle Swarm Optimization Algorithm

Energies ◽  
2021 ◽  
Vol 14 (4) ◽  
pp. 1213
Author(s):  
Ahmed Aljanad ◽  
Nadia M. L. Tan ◽  
Vassilios G. Agelidis ◽  
Hussain Shareef
Keyword(s):  
Neural Networks ◽  
Particle Swarm Optimization ◽  
Solar Irradiance ◽  
Particle Swarm ◽  
Time Interval ◽  
Time Intervals ◽  
Swarm Optimization ◽  
Backpropagation Neural Networks ◽  
Proposed Model ◽  
Short Time

Hourly global solar irradiance (GSR) data are required for sizing, planning, and modeling of solar photovoltaic farms. However, operating and controlling such farms exposed to varying environmental conditions, such as fast passing clouds, necessitates GSR data to be available for very short time intervals. Classical backpropagation neural networks do not perform satisfactorily when predicting parameters within short intervals. This paper proposes a hybrid backpropagation neural networks based on particle swarm optimization. The particle swarm algorithm is used as an optimization algorithm within the backpropagation neural networks to optimize the number of hidden layers and neurons used and its learning rate. The proposed model can be used as a reliable model in predicting changes in the solar irradiance during short time interval in tropical regions such as Malaysia and other regions. Actual global solar irradiance data of 5-s and 1-min intervals, recorded by weather stations, are applied to train and test the proposed algorithm. Moreover, to ensure the adaptability and robustness of the proposed technique, two different cases are evaluated using 1-day and 3-days profiles, for two different time intervals of 1-min and 5-s each. A set of statistical error indices have been introduced to evaluate the performance of the proposed algorithm. From the results obtained, the 3-days profile’s performance evaluation of the BPNN-PSO are 1.7078 of RMSE, 0.7537 of MAE, 0.0292 of MSE, and 31.4348 of MAPE (%), at 5-s time interval, where the obtained results of 1-min interval are 0.6566 of RMSE, 0.2754 of MAE, 0.0043 of MSE, and 1.4732 of MAPE (%). The results revealed that proposed model outperformed the standalone backpropagation neural networks method in predicting global solar irradiance values for extremely short-time intervals. In addition to that, the proposed model exhibited high level of predictability compared to other existing models.

Sign in / Sign up

Export Citation Format

Share Document