Search results

Nowadays, database management system has been applied in library management, and a great number of data about readers’ visiting history to resources have been accumulated by libraries. A lot of important information is concealed behind such data. The purpose of this paper is to use a typical data mining (DM) technology named an association rule mining model to find out borrowing rules of readers according to their borrowing records, and to recommend other booklists for them in a personalized way, so as to increase utilization rate of data resources at library.

Association rule mining algorithm is applied to find out borrowing rules of readers according to their borrowing records, and to recommend other booklists for them in a personalized way, so as to increase utilization rate of data resources at library.

Through an analysis on record of book borrowing by readers, library manager can recommend books that may be interested by a reader based on historical borrowing records or current book-borrowing records of the reader.

If many different categories of book-borrowing problems are involved, it will result in large length of encoding as well as giant searching space. Therefore, future research work may be considered in the following aspects: introduce clustering method; and apply association rule mining method to procurement of book resources and layout of books.

The paper provides a helpful inspiration for Big Data mining and software development, which will improve their efficiency and insight on users’ behavior and psychology.

The paper proposes a framework to help users understand others’ behavior, which will aid them better take part in group and community with more contribution and delightedness.

DM technology has been used to discover information concealed behind Big Data in library; the library personalized recommendation problem has been analyzed and formulated deeply; and a method of improved association rules combined with artificial bee colony algorithm has been presented.

This study aims to overcome the problem of traditional association rules relying almost entirely on expert experience to set relevant interest indexes in mining. Second, this project can effectively solve the problem of four types of rules being present in the database at the same time. The traditional association algorithm can only mine one or two types of rules and cannot fully explore the database knowledge in the decision-making process for library recommendation.

The authors proposed a Markov logic network method to reconstruct association rule-mining tasks for library recommendation and compared the method proposed in this paper to traditional Apriori, FP-Growth, Inverse, Sporadic and UserBasedCF algorithms on two history library data sets and the Chess and Accident data sets.

The method used in this project had two major advantages. First, the authors were able to mine four types of rules in an integrated manner without having to set interest measures. In addition, because it represents the relevance of mining in the network, decision-makers can use network visualization tools to fully understand the results of mining in library recommendation and data sets from other fields.

The time cost of the project is still high for large data sets. The authors will solve this problem by mapping books, items, or attributes to higher granularity to reduce the computational complexity in the future.

The authors believed that knowledge of complex real-world problems can be well captured from a network perspective. This study can help researchers to avoid setting interest metrics and to comprehensively extract frequent, rare, positive, and negative rules in an integrated manner.

With the explosive growth of information available on the World Wide Web, it has become much more difficult to access relevant information from the Web. One possible approach to solve this problem is web personalization. In this paper, we propose a novel WUL (Web Usage Lattice) based mining approach for mining association access pattern rules for personalized web recommendations. The proposed approach aims to mine a reduced set of effective association pattern rules for enhancing the online performance of web recommendations. We have incorporated the proposed approach into a personalized web recommender system known as AWARS. The performance of the proposed approach is evaluated based on the efficiency and the quality. In the efficiency evaluation, we measure the number of generated rules and the runtime for online recommendations. In the quality evaluation, we measure the quality of the recommendation service based on precision, satisfactory and applicability. This paper will discuss the proposed WUL‐based mining approach, and give the performance of the proposed approach in comparison with the Apriori‐based algorithms.

This study aims to provide preliminary information to the investor by determining which indices co-movement, with the data mining method.

In this context, data sets containing daily opening and closing prices between 2001 and 2019 have been created for 11 stock market indexes in the world. The association rule algorithm, one of the data mining techniques, is used in the analysis of the data.

It is observed that the US stock market indices take part in the highest confidence levels between association rules. The XU100 stock index co-movement with both the European stock market indices and the US stock indices. In addition, the Hang Seng Index (HSI) (Hong Kong) takes part in the association rules of all stock market indices.

The important issue for data sets is that the opening/closing values of the same day or the previous day are taken into account according to the open or closed status of other stock market indices by taking the opening time of the stock exchange index to be created. Therefore, data sets are arranged for each stock market index, separately. As a result of this data set arranging process, it is possible to find out co-movements of the stock market indexes. It is proof that the world stock indices have co-movement, and this continues as a cycle.

The purpose of this study is to analyse the suitability of photo-sharing platforms, such as Flickr, to extract relevant knowledge on tourists’ spatial movement and point of interest (POI) visitation behaviour and compare the most prominent clustering approaches to identify POIs in various application scenarios.

The study, first, extracts photo metadata from Flickr, such as upload time, location and user. Then, photo uploads are assigned to latent POIs by density-based spatial clustering of applications with noise (DBSCAN) and k-means clustering algorithms. Finally, association rule analysis (FP-growth algorithm) and sequential pattern mining (generalised sequential pattern algorithm) are used to identify tourists’ behavioural patterns.

The approach has been demonstrated for the city of Munich, extracting 13,545 photos for the year 2015. POIs, identified by DBSCAN and k-means clustering, could be meaningfully assigned to well-known POIs. By doing so, both techniques show specific advantages for different usage scenarios. Association rule analysis revealed strong rules (support: 1.0-4.6 per cent; lift: 1.4-32.1 per cent), and sequential pattern mining identified relevant frequent visitation sequences (support: 0.6-1.7 per cent).

As a theoretic contribution, this study comparatively analyses the suitability of different clustering techniques to appropriately identify POIs based on photo upload data as an input to association rule analysis and sequential pattern mining as an alternative but also complementary techniques to analyse tourists’ spatial behaviour.

From a practical perspective, the study highlights that big data sources, such as Flickr, show the potential to effectively substitute traditional data sources for analysing tourists’ spatial behaviour and movement patterns within a destination. Especially, the approach offers the advantage of being fully automatic and executable in a real-time environment.

The study presents an approach to identify POIs by clustering photo uploads on social media platforms and to analyse tourists’ spatial behaviour by association rule analysis and sequential pattern mining. The study gains novel insights into the suitability of different clustering techniques to identify POIs in different application scenarios.

本论文旨在分析图片分享平台Flickr对截取游客空间动线信息和景点（POI）游览行为的适用性, 并且对比最知名的几种聚类分析手段, 以确定不同情况下的POI。

本论文首先从Flickr上摘录下图片大数据, 比如上传时间、地点、用户等。其次, 本论文使用DBSCAN和k-means聚类分析参数来将上传图片分配给POI隐性变量。最后, 本论文采用关联规则挖掘分析（FP-growth参数）和序列样式勘探分析（GSP参数）以确认游客行为模式。

本论文以慕尼黑城市为样本, 截取2015年13,545张图片。POIs由DBSCAN和k-means聚类分析将其分配到有名的POIs。由此, 本论文证明了两种技术对不同用法的各自优势。关联规则挖掘分析显示了显著联系（support：1%−4.6%；lift：1.4%−32.1%）, 序列样式勘探分析确立了相关频率游览次序（support：0.6%−1.7%。

本论文的理论贡献在于, 根据图片数据, 通过对比分析不同聚类分析技术对确立POIs, 并且证明关联规则挖掘分析和序列样式勘探分析各有千秋又互相补充的分析技术以确立游客空间行为。

本论文的现实意义在于, 强调了大数据的来源, 比如Flickr,证明了其对于有效代替传统数据的潜力, 以分析在游客在一个旅游目的地的空间行为和动线模式。特别是这种方法实现了实时自动可操作性等优势。

本论文展示了一种方法, 这种方法通过聚类分析社交媒体上的上传图片以确立POIs, 以及通过关联规则挖掘分析和序列样式勘探分析来分析游客空间行为。本论文对于不同聚类分析以确立不同适用情况下的POIs的确立提出了独到见解。

This study aims to apply association rule mining (ARM) to uncover specific associations between operating components of a chiller system and improve its coefficient of performance (COP), hence reducing the electricity use of buildings with central air conditioning.

First, 13 operating variables were identified, comprising measures of temperatures and flow rates of system components and their switching statuses. The variables were grouped into four bins before carrying out ARM. Strong rules were produced to associate the variables and switching statuses with different COP classes.

The strong rules explain existing constraints on practising chiller sequencing and prioritise variables for optimisation. Based on strong rules for the highest COP class, the optimal operating strategy involves rescheduling chillers and their associated components in pairs during a high load operation. Resetting the chilled water supply temperature is the next best strategy, followed by resetting the condenser water entering temperature, subject to operating constraints.

This study considers the even frequency method with four bins only. Replication work can be done with other discretisation methods and different numbers of classes to compare potential differences in the bin ranges of the optimised variables.

The strong rules identified by ARM highlight associations between variables and high or low COPs. This supports the selection of critical variables and the operating status of system components to maximise the COP. Tailor-made optimisation strategies and the associated electricity savings can be further evaluated.

Previous studies applied ARM for chiller fault detection but without considering system performance under the interaction of different components. The novelty of this study is its demonstration of ARM’s intelligence at discovering associations in past operating data. This enables the identification of tailor-made energy management opportunities, which are essential for all engineering systems. ARM is free from the prediction errors of typical regression and black-box models.

This paper aims to extract the comment targets in Chinese online shopping platform.

The authors first collect the comment texts, word segmentation, part-of-speech (POS) tagging and extracted feature words twice. Then they cluster the evaluation sentence and find the association rules between the evaluation words and the evaluation object. At the same time, they establish the association rule table. Finally, the authors can mine the evaluation object of comment sentence according to the evaluation word and the association rule table. At last, they obtain comment data from Taobao and demonstrate that the method proposed in this paper is effective by experiment.

The extracting comment target method the authors proposed in this paper is effective.

First, the study object of extracting implicit features is review clauses, and not considering the context information, which may affect the accuracy of the feature excavation to a certain degree. Second, when extracting feature words, the low-frequency feature words are not considered, but some low-frequency feature words also contain effective information.

Because of the mass online reviews data, reading every comment one by one is impossible. Therefore, it is important that research on handling product comments and present useful or interest comments for clients.

The extracting comment target method the authors proposed in this paper is effective.

The paper discusses the rationale for a widespread reliance on Codes of Conduct (CoC) in European crowdfunding through the lenses of economic theories of self-regulation. By analysing the institutional design of CoCs in crowdfunding, the paper illustrates the differences in their regulatory context, inclusiveness, monitoring and enforcement. It offers the first systematic overview of substantial rules of CoCs in crowdfunding.

A comparative case study of nine CoCs in Europe is used to illustrate differences in their institutional design and discern the economic purpose of the CoC.

The institutional design of different CoCs in Europe mainly supports voluntary theories of self-regulation. In particular, the theory of reputation commons has the most explanatory power. The substantial rules of CoC in different markets show the potential sources of market failure through the perspectives of platforms.

CoCs appear in various regulatory, cultural, and industry contexts of different countries. Some of the institutional design features of CoC might be a result of these characteristics.

Crowdfunding associations wishing to develop their own CoC may learn from a comparative overview of key provisions.

For governments in Europe, contemplating creating or revising bespoke crowdfunding regimes, the paper identifies areas where crowdfunding platforms perceive market failure.

This paper is the first systematic study of self-regulatory institutions in European crowdfunding. The paper employs a theoretical framework for the analysis of self-regulation in crowdfunding and provides a comparison of a regulatory context, inclusiveness, monitoring and enforcement of different CoCs in Europe.

Process mining tools can help discover and improve the business processes of urban community services from historical service event records. However, for the community service domains with small datasets, the effects of process mining are generally limited due to process incompleteness and data noise. In this paper, a cross-domain knowledge transfer method is proposed to help service process discovery with small datasets by making use of rich knowledge in similar domains with large datasets.

First, ontology modeling is used to reduce the effects of cross-domain semantic ambiguity on knowledge transfer. Second, association rules (of the activities in the service processes) are extracted with Bayesian network. Third, applicable association rules are retrieved using an applicability assignment function. Further, the retrieved association rules in domains with large datasets are mapped to those with a small dataset using a linear programming method, with a heuristic miner being adopted to generate the process model.

The proposed method is verified based on the empirical data of 10 service domains from Beidaihe, China. Results show that process discovery performance of all 10 domains were improved with the overall robustness score, precision, recall and F1 score increased by 13%, 13%, 17% and 15%, respectively. For the domains with only small datasets, the cross-domain knowledge transfer method outperforms popular state-of-the art methods.

The limitations of sample sizes are greatly reduced. This scheme can be followed to establish business process management systems of community services with reasonable performance and limited sample sizes.

The purpose of this paper is to determine the best approach to customer segmentation and to extrapolate associated rules for this based on recency, frequency and monetary (RFM) considerations as well as demographic factors. In this study, the impacts of RFM and demographic attributes have been challenged in order to enrich factors that lend comprehension to customer segmentation. Different types of scenario were designed, performed and evaluated meticulously under uniform test conditions. The data for this study were extracted from the database of a global pizza restaurant chain in Turkey. This paper summarizes the findings of the study and also provides evidence of its empirical implications to improve the performance of customer segmentation as well as achieving extracted rule perfection via effective model factors and variations. Accordingly, marketing and service processes will work more effectively and efficiently for customers and society. The implication of this study is that it explains a clear concept for interaction between producers and consumers.

Customer relationship management, which aims to manage record and evaluate customer interactions, is generally regarded as a vital tool for companies that wish to be successful in the rapidly changing global market. The prediction of customer behaviors is a strategically important and difficult issue because of the high variance and wide range of customer orders and preferences. So to have an effective tool for extracting rules based on customer purchasing behavior, considering tangible and intangible criteria is highly important. To overcome the challenges imposed by the multifaceted nature of this problem, the authors utilized artificial intelligence methods, including k-means clustering, Apriori association rule mining (ARM) and neural networks. The main idea was that customer clusters are better enhanced when segmentation processes are based on RFM analysis accompanied by demographic data. Weighted RFM (WRFM) and unweighted RFM values/scores were applied with and without demographic factors and utilized to compose different types and numbers of clusters. The Apriori algorithm was used to extract rules of association. The performance analyses of scenarios have been conducted based on these extracted rules. The number of rules, elapsed time and prediction accuracy were used to evaluate the different scenarios. The results of evaluations were compared with the outputs of another available technique.

The results showed that having an appropriate segmentation approach is vital if there are to be strong association rules. Also, it has been determined from the results that the weights of RFM attributes affect rule association performance positively. Moreover, to capture more accurate customer segments, a combination of RFM and demographic attributes is recommended for clustering. The results’ analyses indicate the undeniable importance of demographic data merged with WRFM. Above all, this challenge introduced the best possible sequence of factors for an analysis of clustering and ARM based on RFM and demographic data.

The work compared k-means and Kohonen clustering methods in its segmentation phase to prove the superiority of adopted segmentation techniques. In addition, this study indicated that customer segments containing WRFM scores and demographic data in the same clusters brought about stronger and more accurate association rules for the understanding of customer behavior. These so-called achievements were compared with the results of classical approaches in order to support the credibility of the proposed methodology. Based on previous works, classical methods for customer segmentation have overlooked any combination of demographic data with WRFM during clustering before proceeding to their rule extraction stages.