Search results

Traditional case-adaptation methods have poor accuracy, low efficiency and limited applicability, which cannot meet the needs of knowledge users. To address the shortcomings of the existing research in the industry, this paper proposes a case-adaptation optimization algorithm to support the effective application of tacit knowledge resources.

The attribute simplification algorithm based on the forward search strategy in the neighborhood decision information system is implemented to realize the vertical dimensionality reduction of the case base, and the fuzzy C-mean (FCM) clustering algorithm based on the simulated annealing genetic algorithm (SAGA) is implemented to compress the case base horizontally with multiple decision classes. Then, the subspace K-nearest neighbors (KNN) algorithm is used to induce the decision rules for the set of adapted cases to complete the optimization of the adaptation model.

The findings suggest the rapid enrichment of data, information and tacit knowledge in the field of practice has led to low efficiency and low utilization of knowledge dissemination, and this algorithm can effectively alleviate the problems of users falling into “knowledge disorientation” in the era of the knowledge economy.

This study provides a model with case knowledge that meets users’ needs, thereby effectively improving the application of the tacit knowledge in the explicit case base and the problem-solving efficiency of knowledge users.

The adaptation model can serve as a stable and efficient prediction model to make predictions for the effects of the many logistics and e-commerce enterprises' plans.

This study designs a multi-decision class case-adaptation optimization study based on forward attribute selection strategy-neighborhood rough sets (FASS-NRS) and simulated annealing genetic algorithm-fuzzy C-means (SAGA-FCM) for tacit knowledgeable exogenous cases. By effectively organizing and adjusting tacit knowledge resources, knowledge service organizations can maintain their competitive advantages. The algorithm models established in this study develop theoretical directions for a multi-decision class case-adaptation optimization study of tacit knowledge.

This study aims to deal with the case adaptation problem associated with continuous data by providing a non-zero base solution for knowledge users in solving a given situation.

Firstly, the neighbourhood transformation of the initial case base and the view similarity between the problem and the existing cases will be examined. Multiple cases with perspective similarity or above a predefined threshold will be used as the adaption cases. Secondly, on the decision rule set of the decision space, the deterministic decision model of the corresponding distance between the problem and the set of lower approximate objects under each choice class of the adaptation set is applied to extract the decision rule set of the case condition space. Finally, the solution elements of the problem will be reconstructed using the rule set and the values of the problem's conditional elements.

The findings suggest that the classic knowledge matching approach reveals the user with the most similar knowledge/cases but relatively low satisfaction. This also revealed a non-zero adaptation based on human–computer interaction, which has the difficulties of solid subjectivity and low adaptation efficiency.

In this study the multi-case inductive adaptation of the problem to be solved is carried out by analyzing and extracting the law of the effect of the centralized conditions on the decision-making of the adaptation. The adaption process is more rigorous with less subjective influence better reliability and higher application value. The approach described in this research can directly change the original data set which is more beneficial to enhancing problem-solving accuracy while broadening the application area of the adaptation mechanism.

The examination of the calculation cases confirms the innovation of this study in comparison to the traditional method of matching cases with tacit knowledge extrapolation.

The algorithm models established in this study develop theoretical directions for a multi-case induction adaptation study of tacit knowledge.

This study designs a multi-case induction adaptation scheme by combining NRS and CBR for implicitly knowledgeable exogenous cases. A game-theoretic combinatorial assignment method is applied to calculate the case view and the view similarity based on the threshold screening.