Search results

The purpose of this paper is to present a fuzzy-rule-based model to classify spare parts inventories considering multiple criteria for better management of maintenance activities to overcome production down situation.

Fuzzy-rule-based approach for multi-criteria decision making is used to classify the spare parts inventories. Total cost is computed for each group considering suitable inventory policies and compared with other existing models.

Fuzzy-rule-based multi-criteria classification model provides better results as compared to aggregate scoring and traditional ABC classification. This model offers the flexibility for inventory management experts to provide their subjective inputs.

The web-based model developed in this paper can be implemented in various industries such as manufacturing, chemical plants, and mining, etc., which deal with large number of spares. This method classifies the spares into three categories A, B and C considering multiple criteria and relationships among those criteria. The framework is flexible enough to add additional criteria and to modify fuzzy-rule-base at any point of time by the decision makers. This model can be easily integrated to any customized Enterprise Resource Planning applications.

The value of this paper is in applying Fuzzy-rule-based approach for Multi-criteria Inventory Classification of spare parts. This rule-based approach considering multiple criteria is not very common in classification of spare parts inventories. Total cost comparison is made to compare the performance of proposed model with the traditional classifications and the result shows that proposed fuzzy-rule-based classification approach performs better than the traditional ABC and gives almost the same cost as aggregate scoring model. Hence, this method is valid and adds a new value to spare parts classification for better management decisions.

The purpose of this paper is to examine the important application value of extending the concept of classification rule, so that it can describe and measure the uncertainty of classification knowledge.

The rough concept lattice (RCL), which is an effective tool for uncertain data analysis and knowledge discovery, reflects a kind of unification of concept intent and upper/lower approximation extent, as well as the certain and uncertain relations between objects and attributes.

A classification rules extraction algorithm, extraction algorithm of classification rule (EACR), based on the RCL is presented by adapting the rough degree to measure uncertainty of classification rule. The algorithm EACR is experimentally validated by taking the star spectrum data as the decision context.

An efficient way for classification rule extraction is provided.

The algorithm EACR based on the RCL is presented by adapting the rough degree to measure uncertainty of classification rule.

The examination of revisit intentions in hospitality is integral to relationship marketing and customer loyalty. Its measurement and determination have largely been done through closed-ended measures in surveys of customers. However, vast troves of consumer-generated media in the form of open-ended text reviews can also serve as sources for the determination of revisit intentions. The purpose of this paper is to develop and test a rule-based classification model from big data to extract revisit intentions.

Data for this came from 116,241 reviews scraped from Tripadvisor.com using a stratified sampling technique comprising hotels in major cities in the USA. A sample comprising 1,800 reviews was randomly drawn from this larger pool of reviews and manually annotated. A manual-set rule-based model, supervised machine learning (ML) models and hybrid models were developed to extract revisit intention.

The hybrid model of the MSRB method complemented by the gradient boosting ML method performed the best to classify revisit intentions in reviews.

This study’s rule-based classification model can be used by hotels to evaluate revisit intentions from the ever-growing pool of consumer-generated reviews. This can enable hotels to identify drivers of re-patronage and enhance relationship marketing initiatives.

This study is the first to propose an analytical model that taps big data to extracting revisit intentions. In the past, revisit intentions have been assessed using closed-ended questions using traditional survey-based methods.

The purpose of this paper is to discuss and assess the structural characteristics (conceptual utility) of the most popular classification and predictive techniques employed in customer relationship management and customer scoring and to evaluate their classification and predictive precision.

A sample of customers' credit rating and socio‐demographic profiles are employed to evaluate the analytic and classification properties of discriminant analysis, binary logistic regression, artificial neural networks, C5 algorithm, and regression trees employing Chi‐squared Automatic Interaction Detector (CHAID).

With regards to interpretability and the conceptual utility of the parameters generated by the five techniques, logistic regression provides easily interpretable parameters through its logit. The logits can be interpreted in the same way as regression slopes. In addition, the logits can be converted to odds providing a common sense evaluation of the relative importance of each independent variable. Finally, the technique provides robust statistical tests to evaluate the model parameters. Finally, both CHAID and the C5 algorithm provide visual tools (regression tree) and semantic rules (rule set for classification) to facilitate the interpretation of the model parameters. These can be highly desirable properties when the researcher attempts to explain the conceptual and operational foundations of the model.

Most treatments of complex classification procedures have been undertaken idiosyncratically, that is, evaluating only one technique. This paper evaluates and compares the conceptual utility and predictive precision of five different classification techniques on a moderate sample size and provides clear guidelines in technique selection when undertaking customer scoring and classification.

The purpose of this paper is to improve the customer satisfaction by offering online personalized recommendation system.

By employing an innovative associative classification method, this paper is able to predict a customer’s pleasure during the online while-recommending process. Consumers can make an active decision to recommended products. Based on customer’s characteristics, a product will be recommended to the potential buyer if the model predicts that he/she will click to view the product. That is, he/she is satisfied with the recommended product. Finally, the feasibility of the proposed recommendation system is validated through a Taobao shop.

The results of the experimental study clearly show that the online personalized recommendation system maximizes the customer’s satisfaction during the online while-recommending process based on an innovative associative classification method on the basis of consumer initiative decision.

Conventionally, customers are considered as passive recipients of the recommendation system. However, customers are tired of the recommendation system, and they can do nothing sometimes. This paper designs a new recommendation system on the basis of consumer initiative decision. The proposed recommendation system maximizes the customer’s satisfaction during the online while-recommending process.

Rough set theory is a simple and potential methodology in extracting and minimizing rules from decision tables. Its concepts are core, reduct and discovering knowledge in the form of rules. The decision rules explain the decision state to predict and support the new situation. Initially it was proposed as a useful tool for analysis of decision states. This approach produces a set of decision rules involves two types namely certain and possible rules based on approximation. The prediction may highly be affected if the data size varies in larger numbers. Application of Rough set theory towards this direction has not been considered yet. Hence the main objective of this paper is to study the influence of data size and the number of rules generated by rough set methods. The performance of these methods is presented through the metric like accuracy and quality of classification. The results obtained show the range of performance and first of its kind in current research trend.

The purpose of this paper is to propose a way of implementing data mining (DM) techniques and algorithms to apply quality improvement (QI) approaches in order to resolve quality issues (Rokach and Maimon, 2006; Köksal et al., 2011; Kahraman and Yanik, 2016). The effectiveness of the proposed methodologies is demonstrated through their application results. The goal of this paper is to develop a DM system based on the seven new QI tools in order to discover useful knowledge, in the form of rules, that are hidden in a vast amount of data and to propose solutions and actions that will lead an organization to improve its quality through the evaluation of the results.

Four popular data-mining approaches (rough sets, association rules, classification rules and Bayesian networks) are applied on a set of 12,477 case records concerning vehicle damages. The set of rules and patterns that is produced by each algorithm is used as an input in order to dynamically form each of the seven new quality tools (QTs).

The proposed approach enables the creation of the QTs starting from the raw data and passing through the DM process.

The present paper proposes an innovative work concerning the formation of the seven new QTs of quality management using DM popular algorithms. The resulted seven DM QTs were used to identify patterns and understand, so they can lead even non-experts to draw useful conclusions and make decisions.

For classification problems of customer relationship management (CRM), the purpose of this paper is to propose a method with interpretability of the classification results that combines multiple decision trees based on a genetic algorithm.

In the proposed method, multiple decision trees are combined in parallel. Subsequently, a genetic algorithm is used to optimize the weight matrix in the combination algorithm.

The method is applied to customer credit rating assessment and customer response behavior pattern recognition. The results demonstrate that compared to a single decision tree, the proposed combination method improves the predictive accuracy and optimizes the classification rules, while maintaining interpretability of the classification results.

The findings of this study contribute to research methodologies in CRM. It specifically focuses on a new method with interpretability by combining multiple decision trees based on genetic algorithms for customer classification.

This paper aims to present a machine learning approach for solving the problem of Web spam detection. Based on an adoption of the ant colony optimization (ACO), three algorithms are proposed to construct rule-based classifiers to distinguish between non-spam and spam hosts. Moreover, the paper also proposes an adaptive learning technique to enhance the spam detection performance.

The Trust-ACO algorithm is designed to let an ant start from a non-spam seed, and afterwards, decide to walk through paths in the host graph. Trails (i.e. trust paths) discovered by ants are then interpreted and compiled to non-spam classification rules. Similarly, the Distrust-ACO algorithm is designed to generate spam classification ones. The last Combine-ACO algorithm aims to accumulate rules given from the former algorithms. Moreover, an adaptive learning technique is introduced to let ants walk with longer (or shorter) steps by rewarding them when they find desirable paths or penalizing them otherwise.

Experiments are conducted on two publicly available WEBSPAM-UK2006 and WEBSPAM-UK2007 datasets. The results show that the proposed algorithms outperform well-known rule-based classification baselines. Especially, the proposed adaptive learning technique helps improving the AUC scores up to 0.899 and 0.784 on the former and the latter datasets, respectively.

To the best of our knowledge, this is the first comprehensive study that adopts the ACO learning approach to solve the problem of Web spam detection. In addition, we have improved the traditional ACO by using the adaptive learning technique.

Rough set theory (RST) involves techniques for knowledge discovery or data mining. RST is typically applied within decision tables and offers an alternative to more conventional techniques for classification and rule induction. It is based on describing decisions or categories by means of certain approximations. Offers an overview of the basic principle through the use of a small example. Concludes with a marketing case study, dealing with the characteristics of different brands of cereal.