Fuzzy Based Dynamic Replication Algorithm for Improving Data Availability in Data Grids

The data grid is one of the infrastructures for data and storage resource management. Data replication can improve data access performance, fault tolerance, and reduce network transmission bandwidth. As the site storage space is limited in the grid, how to effectively use grid resources become an important challenge. This paper introduces a dynamic grid replication algorithm based on popularity support and confidence (BPSC). Through the algorithm, data and its associated copy can be placed on a suitable site, with reduced access latency. Through Optorsim, simulation results show that the algorithm can provide better performance compared with other algorithms Grid computing is an important branch of distributed computing. Grid computing constructs a virtual computer system through using a different location of the large number of heterogeneous resources (CPU and storage), provides the model to solve the problem of large scale computing and storage. The data grid is mainly the grid for data storage management. The data grid is defined as an effective combination of data and computing resources of distributed systems by Data Grid Group. The large-scale data- intensive applications, such as bioinformatics, high energy physics, space information generated vast amounts of data, these data may be TB scale, even up to the scale of PB. It is not practical to maintain large scale data at each site, and provide computing resources for visitors. At the same time, it will lead to increased access latency through a centralized way to storing and accessing these data from each site. Data replication technology is an effective method to reduce access latency in the data grid system. Data replication is one of the basic methods of distributed systems to improve the efficiency of system access, maintenance, system high availability. Data replication is to store data in the appropriate site for users to effective access to massive data. Data replication can reduce data access latency, reduce network bandwidth consumption, avoid congestion, adjust the load balancing in server-side, improve system reliability. Many data replication algorithm can reduce data access latency, improve system reliability, but which data will be copied, when the data will be copied at, where the data will be copied are the basic means of determining data replication algorithm. In this paper, we introduced a real-time dynamic data replication algorithm. The algorithm is based on the popularity of file dynamic to replicate data, and consider the storage space limitations of the site. Through optorsim simulation verified the algorithm. This paper is organized as follows: Section 2 is about related works on replication in data grids. In Section 3, system model and component in system are presented. The file

In the Data Grid environment, the primary goal of data replication is to shorten the data access time that is experienced by the job and reduce the job turnaround time as a consequence. After introducing a Data Grid architecture that supports efficient data access for the Grid job, two dynamic data replication algorithms are put forward. Combined with different Grid scheduling heuristics, the performances of the data replication algorithms are evaluated with various simulations. The simulation results demonstrate that the dynamic replication algorithms can reduce the job turnaround time remarkably. Especially the combination of Shortest Turnaround Time (STT) scheduling heuristic and Centralized Dynamic Replication (CDR) algorithm exhibits prominent performance in diverse conditions of workload and system environment.

In general, obesity is calculated using the BMI, which is found to have limitations of use when we insert only one type of non-quantitative data as a crisp value, which is commonly used, or even create an obesity forecasting model using data mining techniques. If there is an input of weight and height data as a forecasting factor in various types of data, such as crisp value, estimated value and Fuzzy Linguistic Term value, etc. The algorithm will not possibly work under the data mining technique with such input data. This research presented the solution for this problem in order to enable data mining techniques under limitations of inserted data, including crisp value, estimated value and fuzzy linguistic term value, for forecasting obesity. The researchers created a fuzzy database system in the form of Conceptual Meta Schema to support fuzzy attributed data storage. In addition, there were 3 types of fuzzy attribute matching as follows; Type 1 was matching crisp value ​​with fuzzy linguistic term value, Type 2 was matching estimated value with fuzzy linguistic term value, and Type 3 was matching fuzzy linguistic term value with fuzzy linguistic term value, respectively. The attribute node from these fuzzy attributes would be selected to be used in the work of data mining techniques. Therefore, in this research, the researchers presented and compared the fuzzy model of working under the algorithm of data mining techniques in the form called fuzzy neural network and fuzzy decision tree techniques. The research result, it was found that the appropriate models for predicting obesity were fuzzy neural network algorithm with the neural network structure being 31-3-3, momentum at 0.2, learning rate at 0.3, under dividing data to test with cross-validation folds = 10 yielded accuracy value, precision value, recall value and f-measure at 84.3%, 82.7%, 84.3%, and 82.8%, respectively. Keywords: Obesity, Fuzzy Neural Net, Fuzzy Decision Tree, Fuzzy Attribute Matching, Forecasting Model

Data privacy becomes one of the most important aspects of Data Mining models designing. So far, most of studies on Data Mining algorithms where focused on efficiency and usability. One of a factor of achieved improvements is using a data warehouse as a source of analyzed data. In our work, we focus on the association rule mining within the parallel spatial data warehouse with data privacy preserving. According to the data model of the data warehouse, we use VPSI algorithm which operates on vertically partitioned data. The data protection mechanism uses a secure intersection of sets. The algorithm is based on the parallel version of Apriori algorithm, but instead of mining data on a transaction level, it operates on aggregated data. In our paper we analyze both aspects, efficiency and data privacy level of the algorithm.

With the requirement to find methods to analysis the rapidly increasing data, as a branch of computer science, data mining technique has been widely apply in different domain .One of the most enticing application areas of data mining in these emerging technologies is in finance. To complete the financial tasks, data mining technique is used refer to Stock market forecasting, Bankruptcy Prediction, Credit Risk Estimation, Corporate Performance Prediction and Management Fraud. This paper focuses on new data mining applications in finance. The fast development of Compute technology (such as Cloud Computing) and database together gives data mining a new challenge and chance in data mining of finance. How to apply the new computer and database technique to the data mining, and integrate the previous framework and the new technology together to build a more efficiency and safer framework is a long way to go in the future . Meanwhile, after accumulate enough empirical regularity and experiences, deep field-specific theories will be set up. This means, in the future, it will have more standardized and accurate model and method to apply in different domain of finance by generating more empirical regularities and combining them with domain knowledge.

A Critical Survey of Data Grid Replication Strategies Based on Data Mining Techniques

Diabetes is the common chronic disease and a major health challenge in all population. Gestational diabetes mellitus (GDM) is a type of diabetes developed in women at the time of pregnancy. We present a Data mining (DM) approach to identify the risk factors of Gestational diabetes mellitus (GDM) using different data mining techniques. Dataset used for analysis contains the details of the pregnant women admitted the local hospital of Mysuru, India. The data mining techniques used are k-means clustering, J48 Decision Tree, Random-Forest and Naive-Bayes classifier. Classification accuracy is enhanced by using feature subset selection wrapper approach. Data imbalanced problem is handled by using Synthetic Minority Over-sampling Technique (SMOTE). The performances of the algorithms have been measured and compared in terms of Accuracy.

Clustering is an important technique in data mining. In this paper, we introduce a new clustering algorithm. This algorithm, based on granular computing, constructs a hypergraph (simplicial complex) by the hypergraph bisection algorithm. It will discover the similarities and associations among documents. In some experiments on Web data, the proposed algorithm is used; the results are quite satisfactory. © 2009 Wiley Periodicals, Inc.

This study focuses on predicting which firms will increase capital by issuing new stocks in the near future. Many stakeholders, including banks, credit rating agencies and investors, performs a variety of analyses for firms' growth, profitability, stability, activity, productivity, etc., and regularly report the firms' financial analysis indices. In the paper, we develop predictive models for rights issues using these financial analysis indices and data mining techniques. This study approaches to building the predictive models from the perspective of two different analyses. The first is the analysis period. We divide the analysis period into before and after the IMF financial crisis, and examine whether there is the difference between the two periods. The second is the prediction time. In order to predict when firms increase capital by issuing new stocks, the prediction time is categorized as one year, two years and three years later. Therefore Total six prediction models are developed and analyzed. In this paper, we employ the decision tree technique to build the prediction models for rights issues. The decision tree is the most widely used prediction method which builds decision trees to label or categorize cases into a set of known classes. In contrast to neural networks, logistic regression and SVM, decision tree techniques are well suited for high-dimensional applications and have strong explanation capabilities. There are well-known decision tree induction algorithms such as CHAID, CART, QUEST, C5.0, etc. Among them, we use C5.0 algorithm which is the most recently developed algorithm and yields performance better than other algorithms. We obtained data for the rights issue and financial analysis from TS2000 of Korea Listed Companies Association. A record of financial analysis data is consisted of 89 variables which include 9 growth indices, 30 profitability indices, 23 stability indices, 6 activity indices and 8 productivity indices. For the model building and test, we used 10,925 financial analysis data of total 658 listed firms. PASW Modeler 13 was used to build C5.0 decision trees for the six prediction models. Total 84 variables among financial analysis data are selected as the input variables of each model, and the rights issue status (issued or not issued) is defined as the output variable. To develop prediction models using C5.0 node (Node Options: Output type = Rule set, Use boosting = false, Cross-validate = false, Mode = Simple, Favor = Generality), we used 60% of data for model building and 40% of data for model test. The results of experimental analysis show that the prediction accuracies of data after the IMF financial crisis (59.04% to 60.43%) are about 10 percent higher than ones before IMF financial crisis (68.78% to 71.41%). These results indicate that since the IMF financial crisis, the reliability of financial analysis indices has increased and the firm intention of rights issue has been more obvious. The experiment results also show that the stability-related indices have a major impact on conducting rights issue in the case of short-term prediction. On the other hand, the long-term prediction of conducting rights issue is affected by financial analysis indices on profitability, stability, activity and productivity. All the prediction models include the industry code as one of significant variables. This means that companies in different types of industries show their different types of patterns for rights issue. We conclude that it is desirable for stakeholders to take into account stability-related indices and more various financial analysis indices for short-term prediction and long-term prediction, respectively. The current study has several limitations. First, we need to compare the differences in accuracy by using different data mining techniques such as neural networks, logistic regression and SVM. Second, we are required to develop and to evaluate new prediction models including variables which research in the theory of capital structure has mentioned about the relevance to rights issue.

Preparing a data set for analysis is generally the most time consuming task in a data mining project, requiring many complex SQL queries, joining tables and aggregating columns. Existing SQL aggregations have limitations to prepare data sets because they return one column per aggregated group. In general, a significant manual effort is required to build data sets, where a horizontal layout is required. We propose simple, yet powerful, methods to generate SQL code to return aggregated columns in a horizontal tabular layout, returning a set of numbers instead of one number per row. This new class of functions is called horizontal aggregations. Horizontal aggregations build data sets with a horizontal denormalized layout (e.g. point-dimension, observation-variable, instance-feature), which is the standard layout required by most data mining algorithms. We propose three fundamental methods to evaluate horizontal aggregations: CASE: Exploiting the programming CASE construct; SPJ: Based on standard relational algebra operators (SPJ queries); PIVOT: Using the PIVOT operator, which is offered by some DBMSs. Experiments with large tables compare the proposed query evaluation methods. Our CASE method has similar speed to the PIVOT operator and it is much faster than the SPJ method. In general, the CASE and PIVOT methods exhibit linear scalability, where as the SPJ method does not. In a relational database, especially with normalized tables, a significant effort is required to prepare a summary data set that can be used as input for a data mining or statistical algorithm. Most algorithms require as input a data set with a horizontal layout, with several Records and one variable or dimension per column. That is the case with models like clustering, classification, regression and PCA; consult. Each research discipline uses different terminology to describe the data set. In data mining the common terms are point-dimension. Statistics literature generally uses observation-variable. Machine learning research uses instance-feature. This article introduces a new class of aggregate functions that can be used to build data sets in a horizontal layout (denormalized with aggregations), automating SQL query writing and extending SQL capabilities. We show evaluating horizontal aggregations is a challenging and interesting problem and we introduced alternative methods and optimizations for their efficient evaluation. II. MOTIVATION As mentioned above, building a suitable data set for data mining purposes is a time- consuming task. This task generally requires writing long SQL statements or customizing SQL Code if it is automatically generated by some tool. There are two main ingredients in such SQL code: joins and aggregations; we focus on the second one. The most widely- known aggregation is the sum of a column over groups of rows. Some other aggregations return the average, maximum, minimum or row count over groups of rows. There exist many aggregations functions and operators in SQL. Unfortunately, all these aggregations have limitations to build data sets for data mining purposes. The main reason is that, in general, data sets that are stored in a relational database (or a data warehouse) come

The trends of data mining on healthcare data for improving medical services have increased because of the electronic healthcare record(EHR) system, which collects a massive amount of data on a daily basis. In the current scenario, hospital maintains its EHR system and stores the detailed information of patients. Data mining for healthcare improvement requires the data from all the EHR systems located at a different location to be stored at the central data mining server. Collection of healthcare data at some untrusted central data mining server raises privacy threats. Healthcare data contains patients’ private information and sharing this information for data mining creates privacy issues. Most of the previous research either focused on k-anonymity technique which causes information loss and decreases data mining accuracy or privacy preserving data mining which is focused on only specific data mining technique. We adopt source anonymous technique as privacy preserving scheme and present a novel scheme for healthcare data collection and mining in this paper. Our scheme collects data from all EHR systems without any information loss and stores at a single central data mining server, also ensuring privacy is preserved. Central data mining server helps to analyze the collected data with different data mining techniques (Association rule mining, Classification, Clustering, etc.) without the involvement of EHR systems. Our scheme is collusion resilient against central data mining server and EHR systems. Theoretical and experimental analysis show the efficiency of our scheme in terms of computation and communication cost. The experimental results using Heart disease dataset show the advantage to EHR systems using the proposed approach in terms of disease prediction accuracy.

In the evolving landscape of financial markets, the convergence of data mining, cybersecurity, and algorithmic trading plays a pivotal role in enhancing trading performance and forensic investigations. This study investigates how data mining techniques are leveraged to extract meaningful patterns and trends from vast financial datasets, improving the accuracy and profitability of algorithmic trading strategies. By identifying historical trends, price movements, and trade margins, data mining enables traders to optimize decision-making processes and manage risks more effectively. Cybersecurity emerges as a critical factor in safeguarding both trading algorithms and sensitive financial data from cyber threats. The integration of advanced cybersecurity measures ensures the integrity, confidentiality, and availability of trading systems, reducing vulnerabilities that could be exploited by malicious actors. Additionally, forensic investigation techniques are employed to detect fraudulent trading activities, such as insider trading and market manipulation, thereby protecting market participants and maintaining regulatory compliance. This research highlights the importance of combining secure data mining practices with robust cybersecurity measures to enhance the overall performance of algorithmic trading systems. Furthermore, it explores how forensic methodologies can help detect anomalies and ensure the transparency and fairness of financial markets. Through an integrated approach, this study emphasizes the potential of data mining and cybersecurity in transforming trading operations while mitigating risks associated with cyber threats and financial fraud.

Analysis of Transaction Database Using Apriori Algorithm. This study examines the use of the Apriori algorithm for analysing transaction databases. The Apriori algorithm is a fundamental technique in data mining that allows for the efficient discovery of frequent patterns and association rules in large datasets. The Apriori algorithm employs a two-step approach. Initially, it identifies frequent items in the database based on a user-defined minimum support threshold. Subsequently, it generates association rules that describe relationships between these frequent items based on metrics such as confidence and lift. This paper provides an in-depth explanation of the Apriori algorithm, emphasizing its strengths and limitations. Additionally, it presents various applications of the Apriori algorithm in real-world scenarios, such as shopping cart analysis, cross-selling and upselling, and customer segmentation. The significance of this study lies in its comprehensive analysis of the Apriori algorithm and its practical relevance in diverse data mining tasks. It serves as a valuable resource for researchers, practitioners, and anyone seeking to understand the fundamentals and applications of association rule mining. Keywords: Datamining, OLTP, Apriori algorithm, Item sets and Market Basket Analysis

Optimizing the use of grid resources is critical for users to effectively exploit a Data Grid (DG). Data replication is considered as a major technique for increasing access performance and data availability in DG systems. Current works on data replications in Grid systems focuses on infrastructure for replication mechanism for creating or deleting replicas. One of the challenges in data replication is determining Optimal Number of Replicas (ONR) with Quality of Service (QoS) assurance, as well as their Optimal Location of Replicas (OLR) in DG. In this paper, we propose an algorithm that finds ONR of an object over DG systems, such that the overall communication and storage cost is minimized. This algorithm ensures that QoS required from the users are satisfied. In addition, we proposed a sketch of the proof for our algorithm and its integrity.

Abstract- Utilization data mining in banking marketing strategy is very effective. Prospective customer seg-mentation is one of the processes carried out in the banking marketing strategy. To support the results of the success rate of telemarketing personnel to market the product in its role of banking services that the process requires a prospective customer data, then data mining support is very important in the classification of the prospective customers of the bank so that it can predict the degree of success in product marketing such services. Based on mapping studies of support data mining on prospective customers to come is no classification algorithms are often used for the classification of a borrower among others Neural Network, Naive Bayes, Dececion Tree, K-NN and Logistic Regreesion, of this algorithm can result from the evaluation process by using Cross Validation, confusion matrix, ROC Curve and T-Test to determine the classification of data mining algo-rithms are the most accurate in predicting success in product mar-keting telemarketing services from the bank to do trials in the Neural Network algorithm was more accurate with an accuracy of 89.71% the AUC value of 0872, this may be a comparison of data mining classi-fication Seeing AUC values of the five methods, then five groups of classification algorithms including both because of its AUC value between 0.80-1.00. Keywords : Comparison of data mining, decision tree, naive Bayes, neural network, k-nn, logistic regression