The Development of Invisible Data Mining Functionality for Discovering Interesting Knowledge: In the case of Bioinformatics

Gebremeskel, Gebeyehu Belay; Zhongshi He; Yuanyuan Jia
March 2013
Journal of Convergence Information Technology;Mar2013, Vol. 8 Issue 5, p1246
Academic Journal
The discovery of interesting knowledge is the ultimately desired result from the DM sequence of processes. Therefore, in this paper, we discussed the algorithms and the invisible DM functionality operators on extracting interesting knowledge from medical data sets towards patient safety care. The data set containing a set of variables, which describe the characteristics and behaviors of medical data sets to explore and visualize the hidden valuable information from the database. For the challenges of KD in biomedical data sets, we introduced new and combining intelligent approaches: the algorithms of the development of invisible DM functionality, and visualization of the mining process. The issues have been discussed based on real data sets of medical data.


Related Articles

  • Parameter-less co-clustering for star-structured heterogeneous data. Ienco, Dino; Robardet, Céline; Pensa, Ruggero; Meo, Rosa // Data Mining & Knowledge Discovery;Mar2013, Vol. 26 Issue 2, p217 

    The availability of data represented with multiple features coming from heterogeneous domains is getting more and more common in real world applications. Such data represent objects of a certain type, connected to other types of data, the features, so that the overall data schema forms a star...

  • An improved comparison of three rough set approaches to missing attribute values. Grzymala-Busse, Jerzy W.; Grzymala-Busse, Witold J.; Hippe, Zdzisław S.; Rząsa, Wojciech // Control & Cybernetics;2010, Vol. 39 Issue 2, p469 

    In a previous paper three types of missing attribute values: lost values, attribute-concept values and "do not care" conditions were compared using six data sets. Since previous experimental results were affected by large variances due to conducting experiments on different versions of a given...

  • TAN Classifiers Based on Decomposable Distributions. Jess Cerquides; Ramon Lpez de Mntaras // Machine Learning;Jun2005, Vol. 59 Issue 3, p323 

    Abstract In this paper we present several Bayesian algorithms for learning Tree Augmented Naive Bayes (TAN) models. We extend the results in Meila & Jaakkola (2000a) to TANs by proving that accepting a prior decomposable distribution over TANs, we can compute the exact Bayesian model averaging...

  • Improved Aprori Algorithm Based on bottom up approach using Probability and Matrix. Kumar, S. Sunil; Karanth, S. Shyam; Akshay, K. C.; Prabhu, Ananth; Kumar, M. Bharathraj // International Journal of Computer Science Issues (IJCSI);Mar2012, Vol. 9 Issue 2, p242 

    Knowledge Discovery through mining association rule among data from a large database is the one of key area of research. The first proposed Algorithm apriori is used to mine frequent items from the large database which leads to mine Association Rule between the data for discovering the Knowledge...

  • Data Mining for the Internet of Things: Literature Review and Challenges. Chen, Feng; Deng, Pan; Wan, Jiafu; Zhang, Daqiang; Vasilakos, Athanasios V.; Rong, Xiaohui // International Journal of Distributed Sensor Networks;8/30/2015, Vol. 2015, p1 

    The massive data generated by the Internet of Things (IoT) are considered of high business value, and data mining algorithms can be applied to IoT to extract hidden information from data. In this paper, we give a systematic way to review data mining in knowledge view, technique view, and...

  • Hiding sensitive knowledge without side effects. Gkoulalas-Divanis, Aris; Verykios, Vassilios // Knowledge & Information Systems;Sep2009, Vol. 20 Issue 3, p263 

    Sensitive knowledge hiding in large transactional databases is one of the major goals of privacy preserving data mining. However, it is only recently that researchers were able to identify exact solutions for the hiding of knowledge, depicted in the form of sensitive frequent itemsets and their...

  • A review on particle swarm optimization algorithms and their applications to data clustering. Rana, Sandeep; Jasola, Sanjay; Kumar, Rajesh // Artificial Intelligence Review;Mar2011, Vol. 35 Issue 3, p211 

    Data clustering is one of the most popular techniques in data mining. It is a method of grouping data into clusters, in which each cluster must have data of great similarity and high dissimilarity with other cluster data. The most popular clustering algorithm K-mean and other classical...

  • Multirelational classification: a multiple view approach. Guo, Hongyu; Viktor, Herna // Knowledge & Information Systems;Dec2008, Vol. 17 Issue 3, p287 

    Multirelational classification aims at discovering useful patterns across multiple inter-connected tables (relations) in a relational database. Many traditional learning techniques, however, assume a single table or a flat file as input (the so-called propositional algorithms). Existing...

  • Enhancing Parallel Data Mining Performance on a Large Cluster by Using UCE Scheduling. Nunnapus Benjamas; Putchong Uthayopas // Journal of Next Generation Information Technology;Nov2011, Vol. 2 Issue 4, p69 

    In this paper, we propose an algorithm called Unified Communication and Execution Scheduling (UCE) that combines the execution and communication scheduling for parallel data mining application together. This algorithm enables a better utilization of hardware and interconnection in a multicore...


Read the Article


Sorry, but this item is not currently available from your library.

Try another library?
Sign out of this library

Other Topics