Earticle

Health Insurance Review & Assessment Service (HIRA) claims database has a high potential to detect signals of new drug interactions. The aim of this study was to evaluate the usefulness of information component (IC) and relative risk (RR) as a tool for signal detection, and to analyze the possible drug interactions caused by clopidogrel using HIRA claims database. This study was performed in elderly patients over 65 years of age who administered clopidogrel from January 2005 to June 2006 in South Korea. Serious Adverse Events (SAEs) as drug interactions of clopidogrel were defined as any ambulatory hospitalization for ischemic diseases within comcomitant medication period of clopidogrel. Information Component (IC) and Relative Risk (RR) were calculated to compare the proportion of drug-SAE pairs in order to select drug specific SAEs. IC and RR signals of clopidogrel drug interaction were screened when IC’ 95% confidence interval was greater than 0 and RR’ 95% confidence interval was greater than 1 respectively. All detected signals were compared to references such as Micromedex® and 2010 Drug Interaction Facts™ Sensitivity, specificity, positive predicted value and negative predicted value were used to evaluate usefulness of this method. Among 13,252,930 cases of elderly patients who co-administered clopidogrel and other drugs, 47,485 cases were detected as SAE. Of these, one-hundred nine cases were detected by the IC-based data-mining approach and ninety one cases were detected by the RR-based data-mining approach. Total One-hundred sixty three unrecognized signals were detected by IC or RR. Twelve signals from IC-based data-mining (57.1%) were corresponded with drug interactions from references and eight signals from RR-based data-mining (38.1%) were corresponded with drug interactions from references. These signals include proton pump inhibitors, calcium channel blockers and HMG CoA reductase Inhibitors, which were known to affect CYP450 metabolism. Further studies using HIRA claims database are necessary to develop appropriate data-mining measure.

Along with the rapid development of the database technology, as well as the widespread application of the database management systems are more and more large. Now the data mining technology has already been applied in scientific research, financial investment, market marketing, insurance and medical health and so on, and obtains widespread application. We discuss data mining technology and analyze the questions of it. Therefore, the research in a new data mining method has important significance. Some literatures did not consider the differences between attributes, leading to redundancy when constructing concept lattices. The paper proposes a new method of uncertain data mining based on the concept lattice of connotation difference degree (c_diff). The method defines the two rules. The construction of a concept lattice can be accelerated by excluding attributes with poor discriminative power from the process. There is also a new technique of calculating c_diff, which does not scan the full database on each layer, therefore reducing the number of database scans. The experimental outcomes present that the proposed method can save considerable time and improve the accuracy of the data mining compared with U-Apriori algorithm.

Big data is the compilation of enormous data that arrives from diverse sources for instance online transaction details, social media, sensor data, etc. Such assortment of enormous data develop into tough to evaluate by conventional processing relevance’s. By the development and upcoming latent in the healthcare business field, it is essential to analyze a enormous noisy data to get significant information. In healthcare system, the aim of this work is to evaluate the medical database of diabetes patients by a mixture of innovative hierarchical decision attention network, association rules (AR) and multiclass outlier classification with MapReduce framework. The association rule apriori algorithm in a MapReduce framework considers health data to create regulations. This is employed to discover the association among disease and their signs. This examination is made by means of UCI machine learning datasets of diabetes containing 50 attributes. The results of the proposed algorithm are offered by parameters for instance precision, accuracy, recall, and F-score.

Purpose. The purposes of this study were to apply data mining tool to nursing specific knowledge discovery process and to identify the utilization of data mining skill for clinical decision making. Methods. Data mining based on rough set model was conducted on a large clinical data set containing NMDS elements. Randomized 1000 patient data were selected from year 1998 database which had at least one of the five most frequently used nursing diagnoses. Patient characteristics and care service characteristics including nursing diagnoses, interventions and outcomes were analyzed to derive the meaningful decision rules. Results. Number of comorbidity, marital status, nursing diagnosis related to risk for infection and nursing intervention related to infection protection, and discharge status were the predictors that could determine the length of stay. Four variables (age, impaired skin integrity, pain, and discharge status) were identified as valuable predictors for nursing outcome, relived pain. Five variables (age, pain, potential for infection, marital status, and primary disease) were identified as important predictors for mortality. Conclusions. This study demonstrated the utilization of data mining method through a large data set with stan dardized language format to identify the contribution of nursing care to patient's health.

Data mining is a technique for extracting valuable information from vast amounts of data by analyzing statistical and mathematical operations, rules, and relationships. In this study, we employed data mining technology to analyze the data concerning the painting poetry of Maehwado (plum blossom paintings) from the early Joseon Dynasty. The data was extracted from the Hanguk Munjip Chonggan (Korean Literary Collections in Classical Chinese) in the Hanguk Gojeon Jonghap database (Korea Classics DB). Using computer information processing techniques, we carried out web scraping and classification of the painting poetry from the Hanguk Munjip Chonggan. Subsequently, we narrowed down our focus to the painting poetry specifically related to Maehwado in the early Joseon Dynasty. Based on this, refined dataset, we conducted an in-depth analysis and interpretation of the text data at the syllable corpus level. As a result, we found a direct correlation between the corpus statistics for each syllable in Maehwado painting poetry and the symbolic meaning of plum blossoms.

This paper presents a dynamic development of an ontology-based statistical information system supporting the collection, storage, processing, analysis, and the presentation of statistical knowledge at the national scale. To accomplish this, we propose a data mining technique to dynamically collect data relating to citizens from publicly available data sources; the collected data will then be structured, classified, categorized, and integrated into an ontology. Moreover, an intelligent platform is proposed in order to generate quantitative and qualitative statistical information based on the knowledge stored in the ontology. The main aims of our proposed system are to digitize administrative tasks and to provide reliable statistical information to governmental, economic, and social actors. The authorities will use the ontology-based statistical information system for strategic decision-making as it easily collects, produces, analyzes, and provides both quantitative and qualitative knowledge that will help to improve the administration and management of national political, social, and economic life.

Odoo is an enterprise resource planning information system providing modules to support the basic business function in companies. This research will look into the development of an additional module at Odoo. This module is a data mining module using Market Basket Analysis (MBA) using FP-Growth algorithm in managing OLTP of sales transaction to be useful information for users to improve the analysis of company business strategy. The FP-Growth algorithm used in the application was able to produce multidimensional association rules. The company will know more about their sales and customers' buying habits. Performing sales trend analysis will give a valuable insight into the inner-workings of the business. The testing of the module is using the data from X Supermarket. The final result of this module is generated from a data mining process in the form of association rule. The rule is presented in narrative and graphical form to be understood easier.

Due to the low efficiency and poor accuracy of current college teaching intelligence evaluation methods, an improved method is proposed. Firstly, an improved apriori (IApriori) algorithm is utilized to filter evaluation indexes and establish a teaching quality evaluation indicator system. Secondly, considering the high complexity and low accuracy of the backpropagation neural network (BPNN), principal component analysis (PCA) is taken to reduce the input data's dimension. An improved sparrow search algorithm (ISSA) is simultaneously utilized to optimize the parameters of BPNN. Finally, a PCA-ISSA-BPNN teaching intelligence evaluation model is constructed. The experiments validated that when the number of transactions was 1,000, the IApriori only took 0.32 seconds to run. While the number of projects was 11, IApriori ran in 15.28 seconds. The evaluation accuracy of the PCA-ISSA-BPNN model reached 99.05%, the F1 value was 96.43%, the recall was 97.26%, and the AUC was 0.981. The above data show that IApriori has a higher efficiency in data mining and can more effectively screen evaluation indicators. This research method can effectively and accurately evaluate teaching quality, and has a positive impact on promoting student development, advancing teaching reform, and improving teaching quality.

Main purpose of this article is to classify reservoirs corresponding to their physical characteristics, for example, dam height, dam width, age, repair-works history. First of all, data set of 13,976 reservoirs was analyzed using k means and self organized maps. As a result of these analysis, lots of reservoirs have been classified into four clusters. Factors and their critical values to classify the reservoirs into four groups have been founded by generating a decision tree. The path rules to each group seem reasonable since their survivor function showed unique pattern.

CrossRef is an association of scholarly publishers that develops shared infrastructure to support more effective scholarly communications. It is a registration agency for the digital object identifier (DOI), and has built additional services for CrossRef members around the DOI and the bibliographic metadata that publishers deposit in order to register DOIs for their publications. Among these services are CrossCheck, powered by iThenticate, which helps publishers screen for plagiarism in submitted manuscripts and FundRef, which gives publishers standard way to report funding sources for published scholarly research. To add to these services, Cross-Ref launched CrossRef text and data mining services in May 2014. This article will explain the thinking behind CrossRef launching this new service, what it offers to publishers and researchers alike, how publishers can participate in it, and the uptake of the service so far.

Today, most approaches used in the recommendation system provide correct data prediction similar to the data that users need. The method that researchers are paying attention and apply as a model in the recommendation system is the communities' detection in the big social network. The outputted result of this approach is effective in improving the exactness. Therefore, in this paper, the personalized movie recommendation system that combines data mining for the k-clique method is proposed as the best exactness data to the users. The proposed approach was compared with the existing approaches like k-clique, collaborative filtering, and collaborative filtering using k-nearest neighbor. The outputted result guarantees that the proposed method gives significant exactness data compared to the existing approach. In the experiment, the MovieLens data were used as practice and test data.

The capitalization of know-how, knowledge management, and the control of the constantly growing information mass has become the new strategic challenge for organizations that aim to capture the entire wealth of knowledge (tacit and explicit). Thus, knowledge mapping is a means of (cognitive) navigation to access the resources of the strategic heritage knowledge of an organization. In this paper, we present a new mapping approach based on the Boolean modeling of critical domain knowledge and on the use of different data sources via the data mining technique in order to improve the process of acquiring knowledge explicitly. To evaluate our approach, we have initiated a process of mapping that is guided by machine learning that is artificially operated in the following two stages: data mining and automatic mapping. Data mining is be initially run from an induction of Boolean case studies (explicit). The mapping rules are then used to automatically improve the Boolean model of the mapping of critical knowledge.

Data mining, which is attracting public attention, is a process of drawing out knowledge from a large mass of data. The key technique in data mining is the ability to maximize the similarity in a group and minimize the similarity between groups. Since grouping in data mining deals with a large mass of data, it lessens the amount of time spent with the source data, and grouping techniques that shrink the quantity of the data form to which the algorithm is subjected are actively used. The current grouping algorithm is highly sensitive to static and reacts to local minima. The number of groups has to be stated depending on the initialization value. In this paper we propose a gene algorithm that automatically decides on the number of grouping algorithms. We will try to find the optimal group of the fittest function, and finally apply it to a data mining problem that deals with a large mass of data.

With the explosive increase in the generation and utilization of spatiotemporal data sets, many research efforts have been focused on the efficient handling of the large volume of spatiotemporal sets. With the remarkable growth of ubiquitous computing technology, mining from the huge volume of spatiotemporal data sets is regarded as a core technology which can provide real world applications with intelligence. In this paper, we propose a 3-tier knowledge discovery framework for spatiotemporal data mining. This framework provides a foundation model not only to define the problem of spatiotemporal knowledge discovery but also to represent new knowledge and its relationships. Using the proposed knowledge discovery framework, we can easily formalize spatiotemporal data mining problems. The representation model is very useful in modeling the basic elements and the relationships between the objects in spatiotemporal data sets, information and knowledge.