Search results

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.

The purpose of this study is to show that closure-based classification and regression models provide both high accuracy and interpretability.

Pattern structures allow one to approach the knowledge extraction problem in case of partially ordered descriptions. They provide a way to apply techniques based on closed descriptions to non-binary data. To provide scalability of the approach, the author introduced a lazy (query-based) classification algorithm.

The experiments support the hypothesis that closure-based classification and regression allow one to both achieve higher accuracy in scoring models as compared to results obtained with classical banking models and retain interpretability of model results, whereas black-box methods grant better accuracy for the cost of losing interpretability.

This is an original research showing the advantage of closure-based classification and regression models in the banking sphere.

The purpose of this paper is to report on empirical work conducted to open up algorithmic interpretability and transparency. In recent years, significant concerns have arisen regarding the increasing pervasiveness of algorithms and the impact of automated decision-making in our lives. Particularly problematic is the lack of transparency surrounding the development of these algorithmic systems and their use. It is often suggested that to make algorithms more fair, they should be made more transparent, but exactly how this can be achieved remains unclear.

An empirical study was conducted to begin unpacking issues around algorithmic interpretability and transparency. The study involved discussion-based experiments centred around a limited resource allocation scenario which required participants to select their most and least preferred algorithms in a particular context. In addition to collecting quantitative data about preferences, qualitative data captured participants’ expressed reasoning behind their selections.

Even when provided with the same information about the scenario, participants made different algorithm preference selections and rationalised their selections differently. The study results revealed diversity in participant responses but consistency in the emphasis they placed on normative concerns and the importance of context when accounting for their selections. The issues raised by participants as important to their selections resonate closely with values that have come to the fore in current debates over algorithm prevalence.

This work developed a novel empirical approach that demonstrates the value in pursuing algorithmic interpretability and transparency while also highlighting the complexities surrounding their accomplishment.

Tags help promote customer engagement on video-sharing platforms. Video tag recommender systems are artificial intelligence-enabled frameworks that strive for recommending precise tags for videos. Extant video tag recommender systems are uninterpretable, which leads to distrust of the recommendation outcome, hesitation in tag adoption and difficulty in the system debugging process. This study aims at constructing an interpretable and novel video tag recommender system to assist video-sharing platform users in tagging their newly uploaded videos.

The proposed interpretable video tag recommender system is a multimedia deep learning framework composed of convolutional neural networks (CNNs), which receives texts and images as inputs. The interpretability of the proposed system is realized through layer-wise relevance propagation.

The case study and user study demonstrate that the proposed interpretable multimedia CNN model could effectively explain its recommended tag to users by highlighting keywords and key patches that contribute the most to the recommended tag. Moreover, the proposed model achieves an improved recommendation performance by outperforming state-of-the-art models.

The interpretability of the proposed recommender system makes its decision process more transparent, builds users’ trust in the recommender systems and prompts users to adopt the recommended tags. Through labeling videos with human-understandable and accurate tags, the exposure of videos to their target audiences would increase, which enhances information technology (IT) adoption, customer engagement, value co-creation and precision marketing on the video-sharing platform.

The proposed model is not only the first explainable video tag recommender system but also the first explainable multimedia tag recommender system to the best of our knowledge.

This paper investigates the suitability of fuzzy-logic-based support tools for initial screening of manufacturing reshoring decisions.

Two fuzzy-logic-based support tools are developed together with experts from a Swedish manufacturing firm. The first uses a complete rule base and the second a reduced rule base. Sixteen inference settings are used in both of the support tools.

The findings show that fuzzy-logic-based support tools are suitable for initial screening of manufacturing reshoring decisions. The developed support tools are capable of suggesting whether a reshoring decision should be further evaluated or not, based on six primary competitiveness criteria. In contrast to existing literature this research shows that it does not matter whether a complete or reduced rule base is used when it comes to accuracy. The developed support tools perform similarly with no statistically significant differences. However, since the interpretability is much higher when a reduced rule base is used and it require fewer resources to develop, the second tool is more preferable for initial screening purposes.

The developed support tools are implemented at a primary-criteria level and to make them more applicable, they should also include the sub-criteria level. The support tools should also be expanded to not only consider competitiveness criteria, but also other criteria related to availability of resources and strategic orientation of the firm. This requires further research with regard to multi-stage architecture and automatic generation of fuzzy rules in the manufacturing reshoring domain.

The support tools help managers to invest their scarce time on the most promising reshoring projects and to make timely and resilient decisions by taking a holistic perspective on competitiveness. Practitioners are advised to choose the type of support tool based on the available data.

There is a general lack of decision support tools in the manufacturing reshoring domain. This paper addresses the gap by developing fuzzy-logic-based support tools for initial screening of manufacturing reshoring decisions.

Mining user-concerned actionable and interpretable hot topics will help management departments fully grasp the latest events and make timely decisions. Existing topic models primarily integrate word embedding and matrix decomposition, which only generates keyword-based hot topics with weak interpretability, making it difficult to meet the specific needs of users. Mining phrase-based hot topics with syntactic dependency structure have been proven to model structure information effectively. A key challenge lies in the effective integration of the above information into the hot topic mining process.

This paper proposes the nonnegative matrix factorization (NMF)-based hot topic mining method, semantics syntax-assisted hot topic model (SSAHM), which combines semantic association and syntactic dependency structure. First, a semantic–syntactic component association matrix is constructed. Then, the matrix is used as a constraint condition to be incorporated into the block coordinate descent (BCD)-based matrix decomposition process. Finally, a hot topic information-driven phrase extraction algorithm is applied to describe hot topics.

The efficacy of the developed model is demonstrated on two real-world datasets, and the effects of dependency structure information on different topics are compared. The qualitative examples further explain the application of the method in real scenarios.

Most prior research focuses on keyword-based hot topics. Thus, the literature is advanced by mining phrase-based hot topics with syntactic dependency structure, which can effectively analyze the semantics. The development of syntactic dependency structure considering the combination of word order and part-of-speech (POS) is a step forward as word order, and POS are only separately utilized in the prior literature. Ignoring this synergy may miss important information, such as grammatical structure coherence and logical relations between syntactic components.

The purpose of this paper is to design a model that can accurately forecast the supply chain sales.

This paper proposed a new model based on lightGBM and LSTM to forecast the supply chain sales. In order to verify the accuracy and efficiency of this model, three representative supply chain sales data sets are selected for experiments.

The experimental results show that the combined model can forecast supply chain sales with high accuracy, efficiency and interpretability.

With the rapid development of big data and AI, using big data analysis and algorithm technology to accurately forecast the long-term sales of goods will provide the database for the supply chain and key technical support for enterprises to establish supply chain solutions. This paper provides an effective method for supply chain sales forecasting, which can help enterprises to scientifically and reasonably forecast long-term commodity sales.

The proposed model not only inherits the ability of LSTM model to automatically mine high-level temporal features, but also has the advantages of lightGBM model, such as high efficiency, strong interpretability, which is suitable for industrial production environment.

Patent trade recommendations necessitate recommendation interpretability in addition to recommendation accuracy because of patent transaction risks and the technological complexity of patents. This study designs an interpretable knowledge-aware patent recommendation model (IKPRM) for patent trading. IKPRM first creates a patent knowledge graph (PKG) for patent trade recommendations and then leverages paths in the PKG to achieve recommendation interpretability.

First, we construct a PKG to integrate online company behaviors and patent information using natural language processing techniques. Second, a bidirectional long short-term memory network (BiLSTM) is utilized with an attention mechanism to establish the connecting paths of a company — patent pair in PKG. Finally, the prediction score of a company — patent pair is calculated by assigning different weights to their connecting paths. The semantic relationships in connecting paths help explain why a candidate patent is recommended.

Experiments on a real dataset from a patent trading platform verify that IKPRM significantly outperforms baseline methods in terms of hit ratio and normalized discounted cumulative gain (nDCG). The analysis of an online user study verified the interpretability of our recommendations.

A meta-path-based recommendation can achieve certain explainability but suffers from low flexibility when reasoning on heterogeneous information. To bridge this gap, we propose the IKPRM to explain the full paths in the knowledge graph. IKPRM demonstrates good performance and transparency and is a solid foundation for integrating interpretable artificial intelligence into complex tasks such as intelligent recommendations.

Aspects extracted from the user’s historical records are widely used to define user’s fine-grained preferences for building interpretable recommendation systems. As the aspects were extracted from the historical records, the aspects that represent user’s negative preferences cannot be identified because of their absence from the records. However, these latent aspects are also as important as those aspects representing user’s positive preferences for building a recommendation system. This paper aims to identify the user’s positive preferences and negative preferences for building an interpretable recommendation.

First, high-frequency tags are selected as aspects to describe user preferences in aspect-level. Second, user positive and negative preferences are calculated according to the positive and negative preference model, and the interaction between similar aspects is adopted to address the aspect sparsity problem. Finally, an experiment is designed to evaluate the effectiveness of the model. The code and the experiment data link is: https://github.com/shiyu108/Recommendation-system

Experimental results show the proposed approach outperformed the state-of-the-art methods in widely used public data sets. These latent aspects are also as important as those aspects representing the user’s positive preferences for building a recommendation system.

This paper provides a new approach that identifies and uses not only users’ positive preferences but also negative preferences, which can capture user preference precisely. Besides, the proposed model provides good interpretability.

Recommending suitable doctors to patients on healthcare consultation platforms is important to both the patients and the platforms. Although doctor recommendation methods have been proposed, they failed to explain recommendations and address the data sparsity problem, i.e. most patients on the platforms are new and provide little information except disease descriptions. This research aims to develop an interpretable doctor recommendation method based on knowledge graph and interpretable deep learning techniques to fill the research gaps.

This research proposes an advanced doctor recommendation method that leverages a health knowledge graph to overcome the data sparsity problem and uses deep learning techniques to generate accurate and interpretable recommendations. The proposed method extracts interactive features from the knowledge graph to indicate implicit interactions between patients and doctors and identifies individual features that signal the doctors' service quality. Then, the authors feed the features into a deep neural network with layer-wise relevance propagation to generate readily usable and interpretable recommendation results.

The proposed method produces more accurate recommendations than diverse baseline methods and can provide interpretations for the recommendations.

This study proposes a novel doctor recommendation method. Experimental results demonstrate the effectiveness and robustness of the method in generating accurate and interpretable recommendations. The research provides a practical solution and some managerial implications to online platforms that confront information overload and transparency issues.