From data mining to wisdom mining

2021 ◽  
pp. 016555152110308
Author(s):  
Salma Khan ◽  
Muhammad Shaheen
Keyword(s):  
Data Mining ◽  
Decision Making ◽  
Real World ◽  
Data Mining Algorithms ◽  
Use Of Data ◽  
Comprehensive Literature Review ◽  
Wise Decision ◽  
Mining Algorithms ◽  
The Relationship ◽  
Real World Problems

The knowledge gained from data mining is highly dependent on the experience of an expert for further analysis to increase effectiveness and wise decision-making. This mined knowledge requires actionability enhancement before it can be applied to real-world problems. The literature highlights the reasons that emerged the need to incorporate human wisdom in decision-making for complex problems. To solve this problem, a domain called ‘Wisdom Mining’ is recommended, proposing a set of algorithms parallel to the algorithms proposed by the data mining. In wisdom mining, a process to extract wisdom needs to be defined with less influence from an expert. This review proposed improvements to data mining techniques and their applications in the real world and emphasised the need to seek ways to harness wisdom from data. This study covers the diverse definitions and different perspectives of wisdom within philosophy, psychology, management and computer science. This comprehensive literature review served as a foundation for constructing a wise decision framework that aided in identifying the wisdom factors like context, utility, location and time. The inclusion of these wisdom factors in existing data mining algorithms makes the transition from data mining to wisdom mining possible. This research includes the relationship between these two mining process that facilitated further elucidation of the wisdom mining process. Potential research trends in the domain are also seen as a potential endeavour to improve the analysis and use of data.

Predicting effects of selected impregnation processes on the observed bending strength of wood, with use of data mining models

BioResources ◽  
2021 ◽  
Vol 16 (3) ◽  
pp. 4891-4904
Author(s):  
Selahattin Bardak ◽  
Timucin Bardak ◽  
Hüseyin Peker ◽  
Eser Sözen ◽  
Yildiz Çabuk
Keyword(s):  
Data Mining ◽  
Goodness Of Fit ◽  
Bending Strength ◽  
Wood Preservation ◽  
Ambient Conditions ◽  
Data Mining Algorithms ◽  
Use Of Data ◽  
The Cost ◽  
Mining Algorithms ◽  
The Relationship

Wood materials have been used in many products such as furniture, stairs, windows, and doors for centuries. There are differences in methods used to adapt wood to ambient conditions. Impregnation is a widely used method of wood preservation. In terms of efficiency, it is critical to optimize the parameters for impregnation. Data mining techniques reduce most of the cost and operational challenges with accurate prediction in the wood industry. In this study, three data-mining algorithms were applied to predict bending strength in impregnated wood materials (Pinus sylvestris L. and Millettia laurentii). Models were created from real experimental data to examine the relationship between bending strength, diffusion time, vacuum duration, and wood type, based on decision trees (DT), random forest (RF), and Gaussian process (GP) algorithms. The highest bending strength was achieved with wenge (Millettia laurentii) wood in 10 bar vacuum and the diffusion condition during 25 min. The results showed that all algorithms are suitable for predicting bending strength. The goodness of fit for the testing phase was determined as 0.994, 0.986, and 0.989 in the DT, RF, and GP algorithms, respectively. Moreover, the importance of attributes was determined in the algorithms.

scholarly journals Data warehousing and data mining: A case study

2005 ◽  
Vol 15 (1) ◽  
pp. 125-145 ◽  
Author(s):  
Milija Suknovic ◽  
Milutin Cupic ◽  
Milan Martic ◽  
Darko Krulj
Keyword(s):  
Data Mining ◽  
Decision Making ◽  
Data Warehouse ◽  
Business Decision ◽  
Serbia And Montenegro ◽  
Data Mining Algorithms ◽  
Use Of Data ◽  
Business System ◽  
Time Period ◽  
Mining Algorithms

This paper shows design and implementation of data warehouse as well as the use of data mining algorithms for the purpose of knowledge discovery as the basic resource of adequate business decision making process. The project is realized for the needs of Student's Service Department of the Faculty of Organizational Sciences (FOS), University of Belgrade, Serbia and Montenegro. This system represents a good base for analysis and predictions in the following time period for the purpose of quality business decision-making by top management. Thus, the first part of the paper shows the steps in designing and development of data warehouse of the mentioned business system. The second part of the paper shows the implementation of data mining algorithms for the purpose of deducting rules, patterns and knowledge as a resource for support in the process of decision making.

Distributed Privacy Preserving Clustering via Homomorphic Secret Sharing and Its Application to (Vertically) Partitioned Spatio-Temporal Data

Cyber Crime ◽  
2013 ◽  
pp. 395-415 ◽  
Author(s):  
Can Brochmann Yildizli ◽  
Thomas Pedersen ◽  
Yucel Saygin ◽  
Erkay Savas ◽  
Albert Levi
Keyword(s):  
Data Mining ◽  
Real World ◽  
Privacy Preserving ◽  
Secure Multiparty Computation ◽  
Multiparty Computation ◽  
Privacy Preserving Data Mining ◽  
Computational Costs ◽  
Data Mining Algorithms ◽  
Spatio Temporal ◽  
Mining Algorithms

Recent concerns about privacy issues have motivated data mining researchers to develop methods for performing data mining while preserving the privacy of individuals. One approach to develop privacy preserving data mining algorithms is secure multiparty computation, which allows for privacy preserving data mining algorithms that do not trade accuracy for privacy. However, earlier methods suffer from very high communication and computational costs, making them infeasible to use in any real world scenario. Moreover, these algorithms have strict assumptions on the involved parties, assuming involved parties will not collude with each other. In this paper, the authors propose a new secure multiparty computation based k-means clustering algorithm that is both secure and efficient enough to be used in a real world scenario. Experiments based on realistic scenarios reveal that this protocol has lower communication costs and significantly lower computational costs.

A Two-Stage Zone Regression Method for Global Characterization of a Project Database

2009 ◽  
pp. 2000-2009
Author(s):  
J. J. Dolado ◽  
D. Rodríguez ◽  
J. Riquelme ◽  
F. Ferrer-Troyano ◽  
J. J. Cuadrado
Keyword(s):  
Data Mining ◽  
Project Managers ◽  
Regression Method ◽  
Lower Number ◽  
Data Mining Algorithms ◽  
Use Of Data ◽  
Global Vision ◽  
Mining Algorithms ◽  
Prediction Capability

One of the problems found in generic project databases, where the data is collected from different organizations, is the large disparity of its instances. In this chapter, we characterize the database selecting both attributes and instances so that project managers can have a better global vision of the data they manage. To achieve that, we first make use of data mining algorithms to create clusters. From each cluster, instances are selected to obtain a final subset of the database. The result of the process is a smaller database which maintains the prediction capability and has a lower number of instances and attributes than the original, yet allow us to produce better predictions.

A Two-Stage Zone Regression Method for Global Characterization of a Project Database

2011 ◽  
pp. 1-13 ◽  
Author(s):  
J. J. Dolado ◽  
D. Rodríguez ◽  
J. Riquelme ◽  
F. Ferrer-Troyano ◽  
J. J. Cuadrado
Keyword(s):  
Data Mining ◽  
Project Managers ◽  
Regression Method ◽  
Lower Number ◽  
Data Mining Algorithms ◽  
Use Of Data ◽  
Global Vision ◽  
Mining Algorithms ◽  
Prediction Capability

One of the problems found in generic project databases, where the data is collected from different organizations, is the large disparity of its instances. In this chapter, we characterize the database selecting both attributes and instances so that project managers can have a better global vision of the data they manage. To achieve that, we first make use of data mining algorithms to create clusters. From each cluster, instances are selected to obtain a final subset of the database. The result of the process is a smaller database which maintains the prediction capability and has a lower number of instances and attributes than the original, yet allow us to produce better predictions.

Comprehensibility of Data Mining Algorithms

2011 ◽  
pp. 190-195 ◽  
Author(s):  
Zhi-Hua Zhou
Keyword(s):  
Data Mining ◽  
Decision Making ◽  
Decision Makers ◽  
Data Mining Algorithm ◽  
Human Beings ◽  
Common People ◽  
Data Mining Algorithms ◽  
Mining Algorithm ◽  
Aid Decision ◽  
Mining Algorithms

Data mining attempts to identify valid, novel, potentially useful, and ultimately understandable patterns from huge volume of data. The mined patterns must be ultimately understandable because the purpose of data mining is to aid decision-making. If the decision-makers cannot understand what does a mined pattern mean, then the pattern cannot be used well. Since most decision-makers are not data mining experts, ideally, the patterns should be in a style comprehensible to common people. So, comprehensibility of data mining algorithms, that is, the ability of a data mining algorithm to produce patterns understandable to human beings, is an important factor.

scholarly journals Analysis And Detection of Diabetes Using Data Mining Techniques – Efficiency Comparison

2021 ◽  
pp. 73-79
Author(s):  
G. Ramadevi ◽  
Srujitha Yeruva ◽  
P. Sravanthi ◽  
P. Eknath Vamsi ◽  
S. Jaya Prakash
Keyword(s):  
Data Mining ◽  
Clustering Algorithms ◽  
Medical Data ◽  
Healthcare Sector ◽  
Data Mining Techniques ◽  
Data Mining Algorithms ◽  
Use Of Data ◽  
Efficiency Comparison ◽  
Using Data ◽  
Mining Algorithms

In a digitized world, data is growing exponentially and it is difficult to analyze the data and give the results. Data mining techniques play an important role in healthcare sector - BigData. By making use of Data mining algorithms it is possible to analyze, detect and predict the presence of disease which helps doctors to detect the disease early and in decision making. The objective of data mining techniques used is to design an automated tool that notifies the patient’s treatment history disease and medical data to doctors. Data mining techniques are very much useful in analyzing medical data to achieve meaningful and practical patterns. This project works on diabetes medical data, classification and clustering algorithms like (OPTICS, NAIVEBAYES, and BRICH) are implemented and the efficiency of the same is examined.

scholarly journals The Use of Data Mining Techniques in Predicting the Noise Emitted By the Trailing Edge of Aerodynamic Objects

2019 ◽  
Vol 3 (4) ◽  
Author(s):  
Abdusalam Shaltooki ◽  
Mojtaba Jamshidi
Keyword(s):  
Data Mining ◽  
Random Forest ◽  
Moving Objects ◽  
Low Cost ◽  
Absolute Error ◽  
Negative Effects ◽  
Rbf Network ◽  
Data Mining Algorithms ◽  
Use Of Data ◽  
Mining Algorithms

Aerodynamic is a branch of fluid dynamics that evaluates the behavior of airflow and its interaction with moving objects. The most important application of aerodynamic is in aerospace engineering, designing and construction of flying objects. Reduction of noise emitted by aerodynamic objects is one of the most important challenges in this area and many efforts have been to reduce its negative effects. The prediction of noise emitted from these aerodynamic objects is a low-cost and fast approach that can partially replace the "fabrication and testing" phase. One of the most common and successful tools in prediction procedures is data mining technology. In this paper, the performance of different data mining algorithms such as Random Forest, J48, RBF Network, SVM, MLP, Logistic, and Bagging is evaluated in predicting the amount of noise emitted from aerodynamic objects. The experiments are conducted on a dataset collected by NASA, which is called "Airfoil Self-Noise". The obtained results illustrate that the proposed hybrid model derived from the combination of Random Forest and Bagging algorithms has better performance compared to other methods with an accuracy of 77.6% and mean absolute error of 0.2279.

Sign in / Sign up

Export Citation Format

Share Document