Generalized Sequential Pattern Research Articles

Designing User Experience Improvement and User Behavior Pattern Recognition Algorithms in Design Operation

Enhancing user experience (UX) is a key component in customer retention and sales promotion in e-commerce platforms. To build an effective UX model it is necessary to predict the user behavior more accurately and develop UX model that is tailored based on those behavior patterns. Existing models lack the ability to integrate advanced Machine Learning (ML) models to address the challenges. This study is an attempt to tackle these limitations that employs advanced AI tools to predict user behavior so that to construct an more effective UX model. The study involved 80 users from China who were aged 26 to 52, with diverse backgrounds in education, occupation, and tech proficiency. The work have employed Google Analytics, Hotjar, and FullStory to collect the user interactions and by using Generalized Sequential Pattern (GSP) algorithm, Decision Trees (DT), and Logistic Regression (LR) the work attempts to accurately predict the user behavior patterns. The results show that the model achieved better accuracy of 0.8795 and an F1 Score of 0.8610 on the test dataset. It also excelled in conversion rate (12.34%) and bounce rate (28.65%) which show effectiveness in retaining users and converting visits into actions.

Sequential Behavior of Broiler Chickens in Enriched Environments under Varying Thermal Conditions Using the Generalized Sequential Pattern Algorithm: A Proof of Concept.

Behavior analysis is a widely used non-invasive tool in the practical production routine, as the animal acts as a biosensor capable of reflecting its degree of adaptation and discomfort to some environmental challenge. Conventional statistics use occurrence data for behavioral evaluation and well-being estimation, disregarding the temporal sequence of events. The Generalized Sequential Pattern (GSP) algorithm is a data mining method that identifies recurrent sequences that exceed a user-specified support threshold, the potential of which has not yet been investigated for broiler chickens in enriched environments. Enrichment aims to increase environmental complexity with promising effects on animal welfare, stimulating priority behaviors and potentially reducing the deleterious effects of heat stress. The objective here was to validate the application of the GSP algorithm to identify temporal correlations between heat stress and the behavior of broiler chickens in enriched environments through a proof of concept. Video image collection was carried out automatically for 48 continuous hours, analyzing a continuous period of seven hours, from 12:00 PM to 6:00 PM, during two consecutive days of tests for chickens housed in enriched and non-enriched environments under comfort and stress temperatures. Chickens at the comfort temperature showed high motivation to perform the behaviors of preening (P), foraging (F), lying down (Ld), eating (E), and walking (W); the sequences <{Ld,P}>; <{Ld,F}>; <{P,F,P}>; <{Ld,P,F}>; and <{E,W,F}> were the only ones observed in both treatments. All other sequential patterns (comfort and stress) were distinct, suggesting that environmental enrichment alters the behavioral pattern of broiler chickens. Heat stress drastically reduced the sequential patterns found at the 20% threshold level in the tested environments. The behavior of lying laterally "Ll" is a strong indicator of heat stress in broilers and was only frequent in the non-enriched environment, which may suggest that environmental enrichment provides the animal with better opportunities to adapt to stress-inducing challenges, such as heat.

Prediction of Maintenance Activities Using Generalized Sequential Pattern and Association Rules in Data Mining

This study proposed a data mining framework for predicting sequential patterns of maintenance activities. The framework consisted of data collection, prediction of maintenance activities with and without attributes, and then the comparison between prediction results. In data collection, historical data were collected regarding maintenance activities and product attributes. The generalized sequential pattern (GSP) and association rules were then applied to predict maintenance activities with and without attributes to determine the frequent sequential patterns and significant rules of maintenance activities. Finally, a comparison was performed between the sequences of maintenance activities with and without attributes. A real case study of washing machine products was presented to illustrate the developed framework. The results showed that the proposed framework effectively predicted the next maintenance activities and planning preventive maintenance based on product attributes. In conclusion, the data mining approach is found effective in determining the maintenance sequence that reduces downtime and thereby enhancing productivity and availability.

Sequential Pattern Mining to Support Customer Relationship Management at Beauty Clinics

&#x0D; &#x0D; &#x0D; &#x0D; The increasing competition for beauty clinics, makes management need to think of methods to survive in this competition. For that, the company needs to improve CRM in its service to customers. Customer Relationship Management is a series of activities managed in an effort to better understand, attract attention, and maintain customer loyalty.&#x0D; Sequential Pattern Mining is one of the data mining techniques that is useful for finding patterns sequential / sequence of a set of items. The algorithm that is used is the Generalized Sequential Pattern (GSP). GSP performs candidate generation and support counting processes that is, the union of L1−k with itself which generates a candidate sequence that cannot exist as twin candidate, after that deletion candidate who does not meet the minimum support. While carrying out the process through existing data, is also carried out increasing the number of supports from the included candidates in data sequences. The output to be produced by the program are all frequent itemsets that satisfy minimum support in the form of rules.&#x0D; Sales transaction data will be processed by using the Generalized Sequential Pattern algorithm so that it can produce a rule, namely the purchase order that meets the minimum support. The result of the rule used by management to support enterprise CRM activities such as acquiring new customers, increasing the profits from existing customers, and retaining existing customers.&#x0D; &#x0D; &#x0D; &#x0D; &#x0D;

A hybrid recommender system based on customer behavior and transaction data using generalized sequential pattern algorithm

In the future, the quality of product suggestions in online retailers will influence client purchasing decisions. Unqualified product suggestions can result in two sorts of errors: false negatives and false positives. Customers may not return to the online store as a result of this. By merging sales transaction data and consumer behavior data in clickstream data format, this work offers a hybrid recommender system in an online store utilizing sequential pattern mining (SPM). Based on the clickstream data components, the product data whose status is only observed by consumers is assessed using the simple additive weighting (SAW) approach. Products with the two highest-ranking values are then coupled with product data that has been purchased and examined in the SPM using the generalized sequential pattern (GSP) method. The GSP algorithm produces rules in a sequence pattern, which are then utilized to construct product suggestions. According to the test results, product suggestions derived from a mix of sales transaction data and consumer behavior data outperform product recommendations generated just from sales transaction data. Precision, recall, and F-measure metrics values rose by 185.46, 170.83, and 178.43%, respectively.

Memetic swarm clustering with deep belief network model for e‐learning recommendation system to improve learning performance

AbstractIn this article, an efficient clustering and classification model using memetic swarm clustering and deep belief network called MSC‐DBN model, to derive a recommendation system for web‐based learning. In the proposed method, the three main phases are considered: (i) clustering, (ii) classification, and (iii) recommendation. In first phase, MSC uses ant bee colony, Particle swarm optimization and k‐MEANS clustering. In the second phase, DBN is used for classification in the clustered based users. Clustered based user's has three categories of learners. Finally, MSC‐DBN system is automatically recommends the learning materials to the learners based on the complexity level of the material and learner's capability. A detailed experimental analysis is conducted to ensure the effective recommendation performance. The proposed method is activated in Java. The proposed method attains higher precision 93.26%, 96.12%, and 91.11%, higher recall 89.56%, 92.36%, and 95.66% and higher F‐score 93.12%, 97.14%, and 92.11% compared with the existing approaches, like generalized sequential pattern (GSP) model with context aware (CA)‐collaborative filtering (CF) called (GSP‐CA‐CF), context aware (CA)‐collaborative filtering (CF) called (CF‐CA), and generalized sequential pattern (GSP). Finally, the simulation outcomes demonstrate that the proposed method can be able to find the optimal solutions efficiently and accurately.

Sequential Pattern Mining in StarCraft: Brood War for Short and Long-Term Goals

A wide variety of strategies have been used to create agents in the growing field of real-time strategy AI. However, a frequent problem is the necessity of hand-crafting competencies, which becomes prohibitively difficult in a large space with many corner cases. A preferable approach would be to learn these competencies from the wealth of expert play available. We present a system that uses the Generalized Sequential Pattern (GSP) algorithm from data mining to find common patterns in StarCraft:Brood War replays at both the micro- and macro-level, and verify that these correspond to human understandings of expert play. In the future, we hope to use these patterns to learn tasks and goals in an unsupervised manner for an HTN planner.

The Sequential Behavior Pattern Analysis of Broiler Chickens Exposed to Heat Stress

Broiler productivity is dependent on a range of variables; among them, the rearing environment is a significant factor for proper well-being and productivity. Behavior indicates the bird’s initial response to an adverse environment and is capable of providing an indicator of well-being in real-time. The present study aims to identify and characterize the sequential pattern of broilers’ behavior when exposed to thermoneutral conditions (TNZ) and thermal stress (HS) by constant heat. The research was carried out in a climatic chamber with 18 broilers under thermoneutral conditions and heat stress for three consecutive days (at three different ages). The behavior database was first analyzed using one-way ANOVA, Tukey test by age, and Boxplot graphs, and then the sequence of the behaviors was evaluated using the generalized sequential pattern (GSP) algorithm. We were able to predict behavioral patterns at the different temperatures assessed from the behavioral sequences. Birds in HS were prostrate, identified by the shorter behavioral sequence, such as the {Lying down, Eating} pattern, unlike TNZ ({Lying down, Walking, Drinking, Walking, Lying down}), which indicates a tendency to increase behaviors (feeding and locomotor activities) that guarantee the better welfare of the birds. The sequence of behaviors ‘Lying down’ followed by ‘Lying laterally’ occurred only in HS, which represents a stressful thermal environment for the bird. Using the pattern mining sequences approach, we were able to identify temporal relationships between thermal stress and broiler behavior, confirming the need for further studies on the use of temporal behavior sequences in environmental controllers.

A Situational Analytic Method for User Behavior Pattern in Multimedia Social Networks

The past decade has witnessed the emergence and progress of multimedia social networks (MSNs), which have explosively and tremendously increased to penetrate every corner of our lives, leisure and work. Moreover, mobile Internet and mobile terminals enable users to access to MSNs at anytime, anywhere, on behalf of any identity, including role and group. Therefore, the interaction behaviors between users and MSNs are becoming more comprehensive and complicated. This paper primarily extended and enriched the situation analytics framework for the specific social domain, named as SocialSitu , and further proposed a novel algorithm for users’ intention serialization analysis based on classic Generalized Sequential Pattern (GSP). We leveraged the huge volume of user behaviors records to explore the frequent sequence mode that is necessary to predict user intention. Our experiment selected two general kinds of intentions: playing and sharing of multimedia, which are the most common in MSNs, based on the intention serialization algorithm under different minimum support threshold ( Min_Support ). By using the users’ microscopic behaviors analysis on intentions, we found that the optimal behavior patterns of each user under the Min_Support , and a user's behavior patterns are different due to his/her identity variations in a large volume of sessions data.

Analysis of Sequential Book Loan Data Pattern Using Generalized Sequential Pattern (GSP) Algorithm

As a center for learning and information services, STMIK Amikom Purwokerto Library is a source of learning and a source of intellectual activity that is very important for the entire academic community in supporting the achievement of the college Tridharma program. Book lending transaction data, can produce information that is important as supporting decision making when further analyzed. One useful information is that it can provide information in the form of user behavior patterns in borrowing books that are used to maintain the availability of related book stocks to be balanced. This study uses the Generalized Sequential Pattern (GSP) algorithm, which can be used to determine the behavior patterns of users in each transaction and can show relationships or associations between books, both requested simultaneously and sequentially. From the calculations that have been done, 295 frequent sequences are consisting of 3 sequence patterns that are formed from the minimum support of 0.53% or the minimum number of books borrowed, namely 2 books. Three book items have very strong linkages in book lending transactions, namely book code 6690, 2026, and 8131.

Clinical Data Analytics With Time-Related Graphical User Interfaces: Application to Pharmacovigilance.

Pharmacovigilance consists in monitoring and preventing the occurrence of adverse drug reactions. This activity can be time-consuming because it requires the collection of both patient and medication information. In this paper, we present two visualization and data mining applications to make this task easier for the practitioner. These tools have been developed and tested using the biomedical data warehouse eHOP (Hospital Biomedical Data Warehouse) of the Rennes University Hospital Centre. The first application is a tool to visualize the patient electronic health record in the form of a timeline. All patient data is collected and displayed chronologically. The usability test of the timeline has been very positive (SUS score: 82.5) and the tool is now available for practitioners in their daily practice. The second application is a tool to visualize and search the sequences of a patient cohort. The visual interface allow user to quickly visualize sequences. A query builder allows user to search for sequences in relation with a reference sequence, such as a prescription sequence followed by an abnormal biological value. The sequences are then visually aligned with this reference sequence and ranked by similarity. The GSP (Generalized Sequential Pattern) and Apriori algorithms allow us to display a summary of the sequences list by searching for common sequences and associations. The tool was tested on a use case which consisted in detection of inappropriate drug administration. Compared to a random order, we showed this ranking system saved the practitioner time in this task (to analyze one sequence, 3.49 ± 3.54 vs. 2.26 ± 2.86 s, p = 0.0003). These two visualization and data mining applications will help the daily practice of pharmacovigilance.

IJARCCE - Computer and Communication Engineering

5 Abstract: Sequential Pattern mining is the process of applying data mining techniques to large web data repositories.With the extensive use of Internet, discovery and analysis of useful information from the World Wide Web becomes a practical necessity. Data mining techniques are applied to a sequential database to discover the correlation relationships that exists among the ordered list of events. In this kind of mining, hidden data is extracted to get useful information which helps in knowing the browsing patterns of the users. Web usage mining is a data mining method that can be used in recommending the web usage patterns with the help of users' session and behaviour. The aim of discovering frequent sequential patterns in Web log data is to obtain information about the access behaviour of the users. It helps to understand the buying pattern of the existing customers. This paper focuses on the performance of the sequence tree algorithm which is better than the Generalized Sequential Pattern (GSP) algorithm. This paper emphasizes on the running time of sequence tree algorithm and its ability to discover more number of patterns than the standard GSP algorithm. With the advancement of the Information Technology, usage of World Wide Web is increasing day by day, which is becoming today's necessity. Innumerable visitors interact daily with the web throughout the world. Different kinds of data have to be organized in a way that they can be accessed by many users effectively. Web Mining is the application of data mining technologies which is being used to extract huge Web data repositories. Web mining can be broadly classified into three major parts: Web Contents Mining, Web Usage Mining and Web structure mining.

Feature Level Opinion Mining of Educational Student Feedback Data using Sequential Pattern Mining and Association Rule Mining

This research paper combines the data mining with natural language processing to extract the nuggets of knowledge from massive volume of student feedback dataset on faculty performance. The main objective is to compare two renowned association rule mining and sequential pattern mining algorithms namely Apriori and Generalized Sequential Pattern (GSP) mining in the context of extracting frequent features and opinion words. Student feedback data crawled, pre-process and tagged, then convert in tri-model data files. Both algorithms are applied on prepared data through WEKA 3.7.10 (a machine learning tool) to extract the rules. Mined rules are applied on testing files to extract frequent features and opinion words. Evaluated Results show that GSP is more significant to use for textual data mining than Apriori.

Sequential Pattern Discovery from Web Log Data

mining from the web log data leads to discovery of usage patterns of the user who navigate the web. Patterns which appear frequently in the web log data are item-sets and sequences. In this paper, a novel algorithm Intelligent Generalized Sequential pattern (IGSP) is designed which shows better results than the Generalized Sequential Pattern (GSP) algorithm. Experiment is conducted with respect to running time and number of patterns discovered from the log data and results has shown that IGSP outperforms the well- known algorithms (GSP) algorithm.

Efficient mining of sequential patterns with time constraints by delimited pattern growth

An active research topic in data mining is the discovery of sequential patterns, which finds all frequent subsequences in a sequence database. The generalized sequential pattern (GSP) algorithm was proposed to solve the mining of sequential patterns with time constraints, such as time gaps and sliding time windows. Recent studies indicate that the pattern-growth methodology could speed up sequence mining. However, the capabilities to mine sequential patterns with time constraints were previously available only within the Apriori framework. Therefore, we propose the DELISP (delimited sequential pattern) approach to provide the capabilities within the pattern-growth methodology. DELISP features in reducing the size of projected databases by bounded and windowed projection techniques. Bounded projection keeps only time-gap valid subsequences and windowed projection saves nonredundant subsequences satisfying the sliding time-window constraint. Furthermore, the delimited growth technique directly generates constraint-satisfactory patterns and speeds up the pattern growing process. The comprehensive experiments conducted show that DELISP has good scalability and outperforms the well-known GSP algorithm in the discovery of sequential patterns with time constraints.