Aboul Ella Hassanien (Abo)

To satisfy the ever growing need for effective screening and diagnostic tests, medical practitioners have turned their attention to high resolution, high throughput methods. One approach is to use mass spectrometry based methods for disease diagnosis. Effective diagnosis is achieved by classifying the mass spectra as belonging to healthy or diseased individuals. Unfortunately, the high resolution mass spectrometry data contains a large degree of noisy, redundant and irrelevant information, making accurate classification difficult. To overcome these obstacles, feature extraction methods are used to select or create small sets of relevant features. This paper compares existing feature selection methods to a novel wrapper-based feature selection and centroid-based classification method. A key contribution is the exposition of different feature extraction techniques, which encompass dimensionality reduction and feature selection methods. The experiments, on two cancer data sets, indicate that feature selection algorithms tend to both reduce data dimensionality and increase classification accuracy, while the dimensionality reduction techniques sacrifice performance as a result of lowering the number of features. In order to evaluate the dimensionality reduction and feature selection techniques, we use a simple classifier, thereby making the approach tractable. In relation to previous research, the proposed algorithm is very competitive in terms of (i) classification accuracy, (ii) size of feature sets, (iii) usage of computational resources during both training and classification phases.

This paper proposes an elementary pattern detection approach for viruses propagated through e-mail and address books using the non-uniform pheromone deposition mechanism of ant colony. The local temporary tabu memory has been used to learn the pattern and it can combine known information from past viruses with a type of prediction for future viruses. This is achieved through certain generated test signature of viruses associated with e-mail over landscape. A non-uniform and non-decreasing time function for pheromone deposition and evaporation ensures that subsequent ants who are close enough to a previously selected trial solution will follow the trajectory or test landscape. They are capable to examine gradually thicker deposition of pheromone over the trajectory. It is empirically shown that the proposed modified pheromone learning mechanism can be an alternative approach to detect virus pattern for e-mail messages.

This paper proposes an elementary pattern detection approach for viruses propagated through e-mail and address books using the non-uniform pheromone deposition mechanism of ant colony. The local temporary tabu memory has been used to learn the pattern and it can combine known information from past viruses with a type of prediction for future viruses. This is achieved through certain generated test signature of viruses associated with e-mail over landscape. A non-uniform and non-decreasing time function for pheromone deposition and evaporation ensures that subsequent ants who are close enough to a previously selected trial solution will follow the trajectory or test landscape. They are capable to examine gradually thicker deposition of pheromone over the trajectory. It is empirically shown that the proposed modified pheromone learning mechanism can be an alternative approach to detect virus pattern for e-mail messages.

In this paper, we propose a fragile watermarking hybrid approach using rough set kmeans and exponential particle swarm optimization (EPSO) systems. It is based on a block-wise dependency mechanism which can detect any alterations made to the protected image. Initially, the input image is divided into blocks with equal size in order to improve image tamper localization precision. Then feature sequence is generated by applying rough k-means and EPSO clustering to create the relationship between all image blocks and cluster
all of them since EPSO is used to optimize the parameters of rough k-means. Both feature sequence and generated secret key are used to construct the authentication data. Each resultant 8-bit authentication data is embedded into the eight least significant bits (LSBs) of the corresponding image block. We gives experimental results which show the feasibility of using these optimization algorithms for the fragile watermarking and demonstrate the
accuracy of the proposed approach. The performance comparison of the approach was also realized. The performance of a fragile watermarking approach has been improved in this paper by using exponential particle swarm optimization (EPSO) to optimize the rough kmean parameters. The proposed approach can embed watermark without causing noticeable visual artifacts, and does not only achieve superior tamper detection in images accurately,
it also recovers tampered regions effectively. In addition, the results show that the proposed approach can effectively thwart different attacks, such as the cut-and paste attack and collage attack, while sustaining superior tamper detection and localization accuracy.

In this paper we are looking for a relationship between the intent of Web pages, their architecture and the communities who take part in their usage and creation. From our point of view, the Web page is entity carrying information about these communities and this paper describes techniques, which can be used to extract mentioned information as well as tools usable in analysis of these information. Information about communities could be used in several ways thanks to our approach. Finally we present an experiment which illustrates the benefits of our approach.

n/a