WEB PAGE ACCESS PREDICTION USING FUZZY CLUSTERING BY LOCAL APPROXIMATION MEMBERSHIPS (FLAME) ALGORITHM

ABSTRACT Web page prediction is a technique of web usage mining used to predict the next set of web pages that a user may visit based on the knowledge of previously visited web pages. The World Wide Web (WWW) is a popular and interactive medium for publishing the information. While browsing the web, users are visiting many unwanted pages instead of targeted page. The web usage mining techniques are used to solve that problem by analyzing the web usage patterns for a web site. Clustering is a data mining technique used to identify similar access patterns. If mining is done on those patterns, recommendation accuracy will be improved rather than mining dissimilar access patterns. The discovered patterns can be used for better web page access prediction. Here, two different clustering techniques, namely Fuzzy C-Means (FCM) clustering and FLAME clustering algorithms has been investigated to predict the webpage that will be accessed in the future based on the previous action of browsers behavior. The Performance of FLAME clustering algorithm was found to be better than that of fuzzy C-means, fuzzy K-means algorithms and fuzzy self-organizing maps (SOM). It also improves the user browsing time without compromising prediction accuracy

A framework of combining Markov model with association rules for predicting web page accesses

The importance of predicting Web users' behaviour and their next movement has been recognised and discussed by many researchers lately. Association rules and Markov models are the most commonly used approaches for this type of prediction. Association rules tend to generate many rules, which result in contradictory predictions for a user session. Low order Markov models do not use enough user browsing history and therefore, lack accuracy, whereas, high or- der Markov models incur high state space complexity. This paper proposes a novel approach that integrates both association rules and low order Markov models in order to achieve higher accuracy with low state space complexity. A low order Markov model provides high coverage with low state space complexity, and association rules help achieve better accurac

Automatic breast lesion segmentation in phase preserved DCE-MRIs

We offer a framework for automatically and accurately segmenting breast lesions from Dynamic Contrast Enhanced (DCE) MRI in this paper. The framework is built using max flow and min cut problems in the continuous domain over phase preserved denoised images. Three stages are required to complete the proposed approach. First, post-contrast and pre-contrast images are subtracted, followed by image registrations that benefit to enhancing lesion areas. Second, a phase preserved denoising and pixel-wise adaptive Wiener filtering technique is used, followed by max flow and min cut problems in a continuous domain. A denoising mechanism clears the noise in the images by preserving useful and detailed features such as edges. Then, lesion detection is performed using continuous max flow. Finally, a morphological operation is used as a post-processing step to further delineate the obtained results. A series of qualitative and quantitative trials employing nine performance metrics on 21 cases with two different MR image resolutions were used to verify the effectiveness of the proposed method. Performance results demonstrate the quality of segmentation obtained from the proposed method