Analysis of Rural Tourism Demand Characteristics and Experience Differences Based on Association Rule Mining

Whether the characteristics of rural tourism changes or not provides the scale and basis for judging whether the rural tourism landscape has changed, but it cannot provide a judgment on the impact of rural tourism landscape changes. The impact is relative to the rural tourism landscape goal. The determination of rural tourism landscape objectives provides a baseline for judging the direction and impact of rural tourism characteristics and provides a prerequisite for rural tourism landscape actions. The determination of the quality target of the rural tourism landscape is mainly determined by the internal process and external demand of the rural tourism landscape. Through in-depth research on the frequent pattern growth algorithm FP-Growth, the algorithm can find frequent item sets by not generating candidate item sets. The core of the algorithm is the frequent pattern tree FP-tree, which can efficiently compress the transaction database. Based on the advantages of FP-tree, this paper improves a FP_Apriori algorithm based on frequent pattern trees. This algorithm projects the entire transaction database onto the FP-tree, avoiding a lot of I/O overhead. At the same time, I propose a more directional and targeted search strategy for FP-tree, which reduces the running time of the algorithm and uses the principle of the Mapping_Apriori algorithm to prethin the frequent item sets. This article uses the text analysis method of network data to excavate the characteristics and internal structure of rural tourism demand. The rural tourism market has a wide range of needs and multiple levels, and traditional research methods such as questionnaires have limited sample size and sample structure. With the help of network data, text mining, and other statistical analysis methods, in-depth empirical research on the characteristics and spatial structure of rural tourism in a certain region can cover more research groups. The research confirms that the results of using text analysis and questionnaire analysis on the perception of destination image are relatively consistent. Therefore, the network text analysis method is an effective tool to study the demand structure of the rural tourism market.

Pillar 3: Does banking regulation support stakeholders’ interest in banks financial and risk profile?

The paper examines the interest of the commercial banks’ stakeholders in Pillar 3 disclosures and their behaviour during the timing of serious market turbulence. The aim is to discover to which extent current banking regulation supports stakeholders’ interest in the information required by regulators to be disclosed. The examined data consists of log files that were pre-processed using web mining techniques and from which were extracted frequent item sets by quarters and evaluated in terms of quantity. The authors have proposed a methodology to evaluate frequent item sets of web parts over a dedicated time. Based on the verification of applied methodology on two commercial banks, the results show that stakeholders’ interest in disclosures is highest in the first quarter at each year and after turbulent times in 2009 their interests decreased. Moreover, the results suggest that stakeholders expressed higher interest than in regulatory required Pillar 3 information in the following group of information: Pillar3 related information, Annual reports, Information on Group. Following our results, the paper contributes to cover the gap in the research by analysing Pillar 3 disclosures and their compliance with regulatory requirements, which also increase the interest of the relevant stakeholders to conduce them as an effective market discipline tool.

Efficient Mining of Frequent Item Sets on Large Uncertain Databases

In applications like location-based services, sensor monitoring systems and data integration diligence the data manipulated is highly ambiguous. mining manifold itemsets from generous ambiguous database illustrated under possible world semantics is a crucial dispute. Mining manifold Itemsets is technically brave because the ambiguous database can accommodate a fractional number of possible worlds. The mining process can be formed as a Poisson binomial distribution, by noticing that an Approximated algorithm is established to ascertain manifold Itemsets from generous ambiguous database exceedingly. Preserving the mining result of scaling a database is a substantial dispute when a new dataset is inserted in an existing database. In this paper, an incremental mining algorithm is adduced to retain the mining consequence. The cost and time are reduced by renovating the mining result rather than revising the whole algorithm on the new database from the scrap. We criticize the support for incremental mining and ascertainment of manifold Itemsets. Two common ambiguity models in the mining process are Tuple and Attribute ambiguity. Our approach reinforced both the tuple and attribute uncertainty. Our accession is authorized by interpreting both real and synthetic datasets.

A Federated Learning Approach to Frequent Itemset Mining in Cyber-Physical Systems

Effective vector representation has been proven useful for transaction classification and clustering tasks in Cyber-Physical Systems. Traditional methods use heuristic-based approaches and different pruning strategies to discover the required patterns efficiently. With the extensive and high dimensional availability of transactional data in cyber-physical systems, traditional methods that used frequent itemsets (FIs) as features suffer from dimensionality, sparsity, and privacy issues. In this paper, we first propose a federated learning-based embedding model for the transaction classification task. The model takes transaction data as a set of frequent item-sets. Afterward, the model can learn low dimensional continuous vectors by preserving the frequent item-sets contextual relationship. We perform an in-depth experimental analysis on the number of high dimensional transactional data to verify the developed models with attention-based mechanism and federated learning. From the results, it can be seen that the designed model can help and improve the decision boundary by reducing the global loss function while maintaining both security and privacy.

Frequent Itemset Mining Based on Development of FP-growth Algorithm and Use MapReduce Technique

The Finding of frequent itemset in big data is an important task in data mining and knowledgediscovery. The exponential daily growth of data, called “Big Data”, mining frequent patterns from the hugevolumes of data has many challenges due to memory requirement, multiple data dimensions, heterogeneityof data and so on. The complexities related to mining frequent item-sets from a Big Data can be minimizedby using Modified FP-growth algorithm and parallelizing the mining task with Map Reduce framework inHadoop. In this paper, a modified FP-growth based on directed graph with Hadoop framework will reducethe execution time for the massive database and works efficiently on number of nodes (computers). Thealgorithm was tested, our experimental results demonstrated that the proposed algorithm could scale welland efficiently process large datasets. In addition, it achieves improvement in memory consumption to storefrequent patterns and time complexity.

Automatic Detection of a Student’s Affective States for Intelligent Teaching Systems

AutoTutor is an automated computer tutor that simulates human tutors and holds conversations with students in natural language. Using data collected from AutoTutor, the following determinations were sought: Can we automatically classify affect states from intelligent teaching systems to aid in the detection of a learner’s emotional state? Using frequency patterns of AutoTutor feedback and assigned user emotion in a series of pairs, can the next pair of feedback/emotion series be predicted? Through a priori data mining approaches, we found dominant frequent item sets that predict the next set of responses. Thirty-four participants provided 200 turns between the student and the AutoTutor. Two series of attributes and emotions were concatenated into one row to create a record of previous and next set of emotions. Feature extraction techniques, such as multilayer-perceptron and naive Bayes, were performed on the dataset to perform classification for affective state labeling. The emotions ‘Flow’ and ‘Frustration’ had the highest classification of all the other emotions when measured against other emotions and their respective attributes. The most common frequent item sets were ‘Flow’ and ‘Confusion’.

Biomedical Text Summarization Based on the Itemset Mining Approach

The expanding amount of text-based biomedical information has prompted mining valuable or intriguing frequent patterns (words/terms) from extremely massive content, which is still a very challenging task. In the chapter, the authors have conceived a practical methodology for text mining dependent on the frequent item sets. This chapter presents a strategy utilizing item set mining graph-based summarization for summing up biomedical literature. They address the difficulties of recognizing important subjects or concepts in the given biomedical document text and display the relations between the strings by choosing the high pertinent lines from biomedical literature using apriori itemset mining algorithm. This method utilizes essential criteria to distinguish the significant concepts, events, for example, the fundamental subjects of the input record. These sentences are determined as exceptionally educational, applicable, and chosen to create the final summary.