Aboul Ella Hassanien (Abo)

In this paper, a novel approach is introduced to compare web sites by analysing their web page content. Each web page can be expressed as a set of entities called MicroGenres, which in turn are abstractions about design patterns and genres for representing the page content. This description is useful for web page and web site classification and for a deeper insight into the web site׳s social context.

The web site comparison is useful for extracting patterns which can be used for improving Web search engine effectiveness, the identification of best practices in web site design and of course in the organization of web page content to personalize the web user experience on a web site.

The effectiveness of the proposed approach was tested in a real world case, with e-shop web sites showing that a web site can be represented in a high level of abstraction by using MicroGenres, the contents of which can then be compared and given a measure corresponding to web site similarity. This measure is very useful for detecting web communities on the Web, i.e., a group of web sites sharing similar contents, and the result is essential in performing a focused and effective information search as well as minimizing web page retrieval.

In this paper, a novel binarization approach based on neutrosophic sets and sauvola’s approach is presented.
This approach is used for historical Arabic manuscript images which have problems with types of noise. The input RGB image is changed into the NS domain, which is shown using three subsets, namely, the percentage of indeterminacy in a subset, the percentage of falsity in a subset and the percentage of truth in a subset. The entropy in NS is used for evaluating the indeterminacy with the most important operation ”λ mean” operation in order to minimize indeterminacy which can be used to reduce noise. Finally, the manuscript is binarized using an adaptive thresholding technique. The main advantage of the proposed approach is that it preserves weak connections and provides smooth and continuous strokes. The performance of the proposed approach is evaluated both objectively and subjectively against standard databases and manually collected data base. The proposed method gives high results compared with other famous binarization approaches

Community structure identification in complex networks has been an
important research topic in recent years. Community detection can be viewed as
an optimization problem in which an objective quality function that captures the
intuition of a community as a group of nodes with better internal connectivity
than external connectivity is chosen to be optimized. In this work Artificial bee
colony (ABC) optimization has been used as an effective optimization technique
to solve the community detection problem with the advantage that the number of
communities is automatically determined in the process. However, the algorithm
performance is influenced directly by the quality function used in the optimization
process. A comparison is conducted between different popular communities’
quality measures when used as an objective function within ABC. Experiments
on real life networks show the capability of the ABC to successfully find an optimized
community structure based on the quality function used.

In this paper, we propose a new attribute reduction strat-
egy based on rough sets and grey wolf optimization (GWO). Rough sets
have been used as an attribute reduction technique with much success,
but current hill-climbing rough set approaches to attribute reduction are
inconvenient at nding optimal reductions as no perfect heuristic can
guarantee optimality. Otherwise, complete searches are not feasible for
even medium sized datasets. So, stochastic approaches provide a promis-
ing attribute reduction technique. Like Genetic Algorithms, GWO is a
new evolutionary computation technique, mimics the leadership hierar-
chy and hunting mechanism of grey wolves in nature. The grey wolf
optimization nd optimal regions of the complex search space through
the interaction of individuals in the population. Compared with GAs,
GWO does not need complex operators such as crossover and mutation,
it requires only primitive and easy mathematical operators, and is com-
putationally inexpensive in terms of both memory and runtime. Experi-
mentation is carried out, using UCI data, which compares the proposed
algorithm with a GA-based approach and other deterministic rough set
reduction algorithms. The results show that GWO is ecient for rough
set-based attribute reduction.