Discovering Future Earnings Patterns through FP-Growth and ECLAT Algorithms with Optimized Discretization
نویسندگان
چکیده
Future earnings indicate whether the trend of is increasing or decreasing in future a business. It beneficial to investors and users analysis planning investments. Consequently, this study aimed identify patterns from financial statements on Stock Exchange Thailand. We proposed novel approach based FP-Growth ECLAT algorithms with optimized discretization associated patterns. The are easy use interpret for co-occurrence that differ other studies have only predicted analyzed factor accounting descriptors. found four strongly increases nine decreases. Moreover, we also established ten descriptors related earnings: 1) %∆ long-term debt, 2) debt-to-equity ratio, 3) depreciation/plant assets, 4) operating income/total 5) working capital/total 6) 7) issuance debt as percentage total 8) equity, 9) repayment 10) return closing equity. Doi: 10.28991ESJ-2022-06-06-07 Full Text: PDF
منابع مشابه
Performance Comparison of Apriori, Eclat and Fp-growth Algorithm for Association Rule Learning
The main aim is to generate a frequent itemset. Big Data analytics is the process of examining big data to uncover hidden patterns. Association Rule Learning is a technique which is used to implement big data. It finds the frequent items in the dataset. Frequent itemsets are those items which occur frequently in the database. To find the frequent itemsets, we are using three algorithms APRIORI ...
متن کاملFP-Growth in Discovery of Customer Patterns
The paper describes a knowledge discovery platform and a novel process for finding association rules based on the algorithm FP-Growth and its variants. Built software solution has been optimized in terms of memory usage and computation time as well as the impact of all modifications made to the whole process of rules discovery The process of rule discovery is illustrated on a real database cont...
متن کاملAlgorithms for discovering potentially interesting patterns
A pattern discovered from a collection of data is usually considered potentially interesting if its information content can assist the user in their decision making process. To that end, we have defined the concept of potential interestingness of a pattern based on whether it provides statistical knowledge that is able to affect one’s belief system. In this paper, we introduce two algorithms, r...
متن کاملDiscovering Patterns in Social Networks with Graph Matching Algorithms
Social media data are amenable to representation by directed graphs. A node represents an entity in the social network such as a person, organization, location, or event. A link between two nodes represents a relationship such as communication, participation, or financial support. When stored in a database, these graphs can be searched and analyzed for occurrences of various subgraph patterns o...
متن کاملFP-Tree Based Algorithms Analysis: FP- Growth, COFI-Tree and CT-PRO
Mining frequent itemsets from the large transactional database is a very critical and important task. Many algorithms have been proposed from past many years, But FP-tree like algorithms are considered as very effective algorithms for efficiently mine frequent item sets. These algorithms considered as efficient because of their compact structure and also for less generation of candidates itemse...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Emerging science journal
سال: 2022
ISSN: ['2610-9182']
DOI: https://doi.org/10.28991/esj-2022-06-06-07