Rough Sets Clustering and Markov model for Web Access Prediction

Discovering user access patterns from web access log is increasing the importance of information to build up adaptive web server according to the individual user’s behavior. The variety of user behaviors on accessing information also grows, which has a great impact on the network utilization. In this paper, we present a rough set clustering to cluster web transactions from web access logs and using Markov model for next access prediction. Using this approach, users can effectively mine web log records to discover and predict access patterns. We perform experiments using real web trace logs collected from www.dusit.ac.th servers. In order to improve its prediction ration, the model includes a rough sets scheme in which search similarity measure to compute the similarity between two sequences using upper approximation

A static jobs scheduling for independent jobs in Grid Environment by using Fuzzy C-Mean and Genetic algorithms

The concept of Grid computing is becoming a more important for the high performance computing world. Such flexible resource request could offer the opportunity to optimize several parameters, such as coordinated resource sharing among dynamic collections of individuals, institutions, and resources. Specifically, we investigate the static job scheduling algorithm for independent jobs. In this paper we propose and evaluate experimentally a static scheduling for independent jobs that rely on determining job characteristics at runtime and jobs allocate to resources. We present a static job scheduling algorithm by using Fuzzy C-Mean and Genetic algorithms. Our model presents the strategies of allocating jobs to different nodes, which we have developed the model by using Fuzzy C-Mean algorithm for prediction the characteristics of jobs that run in Grid environment and Genetic algorithm for jobs allocated to large scale sharing of resources. The performance of our model in a static job scheduling have researchers will be discussed. Our model has shown that the scheduling system will allocate jobs efficiently and effectively

Mining Usage Web Log Via Independent Component Analysis And Rough Fuzzy

In the past few years, web usage mining techniques have grown rapidly together with the explosive growth of the web, both in the research and commercial areas. Web Usage Mining is that area of Web Mining which deals with the extraction of interesting knowledge from logging information produced by Web servers. A challenge in web classification is how to deal with the high dimensionality of the feature space. In this paper we present Independent Component Analysis (ICA) for feature selection and using Rough Fuzzy for clustering web user sessions. Our experiments indicate can improve the predictive performance when the original feature set for representing web log is large and can handling the different groups of uncertainties/impreciseness accuracy

Independent Component Analysis And Rough Fuzzy Based Approach To Web Usage Mining

Web Usage Mining is that area of Web Mining which deals with the extraction of interesting knowledge from logging information produced by Web servers. A challenge in web classification is how to deal with the high dimensionality of the feature space. In this paper we present Independent Component Analysis (ICA) for feature selection and using Rough Fuzzy for clustering web user sessions. It aims at discovery of trends and regularities in web users’ access patterns. ICA is a very general-purpose statistical technique in which observed random data are linearly transformed into components that are maximally independent from each other, and simultaneously have “interesting� distributions. Our experiments indicate can improve the predictive performance when the original feature set for representing web log is large and can handling the different groups of uncertainties/ impreciseness accuracy

Integrating genetic algorithms and fuzzy c-means for anomaly detection

The goal of intrusion detection is to discover unauthorized use of computer systems. New intrusion types, of which detection systems are unaware, are the most difficult to detect. The amount of available network audit data instances is usually large; human labeling is tedious, time-consuming, and expensive. Traditional anomaly detection algorithms require a set of purely normal data from which they train their model. In this paper we propose an intrusion detection method that combines Fuzzy Clustering and Genetic Algorithms. Clustering-based intrusion detection algorithm which trains on unlabeled data in order to detect new intrusions. Fuzzy c-Means allow objects to belong to several clusters simultaneously, with different degrees of membership. Genetic Algorithms (GA) to the problem of selection of optimized feature subsets to reduce the error caused by using land-selected features. Our method is able to detect many different types of intrusions, while maintaining a low false positive rate. We used data set from 1999 KDD intrusion detection contest

Anomaly-based intrusion detection using fuzzy rough clustering

It is an important issue for the security of network to detect new intrusion attack and also to increase the detection rates and reduce false positive rates in Intrusion Detection System (IDS). Anomaly intrusion detection focuses on modeling normal behaviors and identifying significant deviations, which could be novel attacks. The normal and the suspicious behavior in computer networks are hard to predict as the boundaries between them cannot be well defined. We apply the idea of the Fuzzy Rough C-means (FRCM) to clustering analysis. FRCM integrates the advantage of fuzzy set theory and rough set theory that the improved algorithm to network intrusion detection. The experimental results on dataset KDDCup99 show that our method outperforms the existing unsupervised intrusion detection method

Meta-scheduler in Grid environment with multiple objectives by using genetic algorithm

Grid computing is the principle in utilizing and sharing large-scale resources of heterogeneous computing systems to solve the complex scientific problem. Such flexible resource request could offer the opportunity to optimize several parameters, such as coordinated resource sharing among dynamic collections of individuals, institutions, and resources. However, the major opportunity is in optimal job scheduling, which Grid nodes need to allocate the resources for each job. This paper proposes and evaluates a new method for job scheduling in heterogeneous computing Systems. Its objectives are to minimize the average waiting time and make-span time. The minimization is proposed by using a multiple objective genetic algorithm (GA), because the job scheduling problem is NP-hard problem. Our model presents the strategies of allocating jobs to different nodes. In this preliminary tests we show how the solution founded may minimize the average waiting time and the make-span time in Grid environment. The benefits of the usage of multiple objective genetic algorithm is improving the performance of the scheduling is discussed. The simulation has been obtained using historical information to study the job scheduling in Grid environment. The experimental results have shown that the scheduling system using the multiple objective genetic algorithms can allocate jobs efficiently and effectively