Aboul Ella Hassanien (Abo)

Rough set theory offers a novel approach to manage uncertainty that has been used for the discovery of data dependencies, importance of features, patterns in sample data, feature space dimensionality reduction, and the classification of objects. Consequently, rough sets have been successfully employed for various image processing tasks including image segmentation, enhancement and classification. Nevertheless, while rough sets on their own provide a powerful technique, it is often the combination with other computational intelligence techniques that results in a truly effective approach. In this paper we show how rough sets have been combined with various other methodologies such as neural networks, wavelets, mathematical morphology, fuzzy sets, genetic algorithms, Bayesian approaches, swarm optimization, and support vector machines in the image processing domain.

Both simulated annealing (SA) and the genetic algorithms (GA) are stochastic and derivative-free optimization technique. SA operates on one solution at a time, while the GA maintains a large population of solutions, which are optimized simultaneously. Thus, the genetic algorithm takes advantage of the experience gained in the past exploration of the solution space. Since SA operates on one solution at a time, it has very little history to use in learning from past trials. SA has the ability to escape from any local point; even it is a global optimization technique. On the other hand, there is no guarantee that the GA algorithm will succeeded in escaping from any local minima, thus it makes sense to hybridize the genetic algorithm and the simulated annealing technique. In this paper, a novel genetically annealed algorithm is proposed and is tested against multidimensional and highly nonlinear cases; Fed-batch fermentor for Penicillin production, and isothermal continuous stirred tank reactor CSTR. It is evident from the results that the proposed algorithm gives good performance.

This paper presents rough sets generating prediction rules scheme for stock price movement. The scheme was able to extract knowledge in the form of rules from daily stock movements. These rules then could be used to guide investors whether to buy, sell or hold a stock. To increase the efficiency of the prediction process, rough sets with Boolean reasoning discretization algorithm is used to discretize the data. Rough set reduction technique is applied to find all the reducts of the data. Finally, rough sets dependency rules are generated directly from all generated reducts. Rough confusion matrix is used to evaluate the performance of the predicted reducts and classes. A comparison between the obtained results using rough sets with decision tree and neural networks algorithms have been made. Rough sets show a higher overall accuracy rates reaching over 97% and generate more compact rules.

This paper presents rough sets generating prediction rules scheme for stock price movement. The scheme was able to extract knowledge in the form of rules from daily stock movements. These rules then could be used to guide investors whether to buy, sell or hold a stock. To increase the efficiency of the prediction process, rough sets with Boolean reasoning discretization algorithm is used to discretize the data. Rough set reduction technique is applied to find all the reducts of the data. Finally, rough sets dependency rules are generated directly from all generated reducts. Rough confusion matrix is used to evaluate the performance of the predicted reducts and classes. A comparison between the obtained results using rough sets with decision tree and neural networks algorithms have been made. Rough sets show a higher overall accuracy rates reaching over 97% and generate more compact rules.

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. For us, the Web page is entity carrying information about these communities. Our 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 proves the feasibility of our approach.