Relative attribute based incremental learning for image recognition

In this study, we propose an incremental learning approach based on a machine-machine interaction via relative attribute feedbacks that exploit comparative relationships among top level image categories. One machine acts as ＇Student （S）＇ with initially limited information and it endeavors to capture the task domain gradually by questioning its mentor on a pool of unlabeled data. The other machine is ＇Teacher （T）＇ with the implicit knowledge for helping S on learning the class models. T initiates relative attributes as a communication channel by randomly sorting the classes on attribute space in an unsupervised manner. S starts modeling the categories in this intermediate level by using only a limited number of labeled data. Thereafter, it first selects an entropy-based sample from the pool of unlabeled data and triggers the conversation by propagating the selected image with its belief class in a query. Since T already knows the ground truth labels, it not only decides whether the belief is true or false, but it also provides an attribute-based feedback to S in each case without revealing the true label of the query sample if the belief is false. So the number of training data is increased virtually by dropping the falsely predicted sample back into the unlabeled pool. Next, S updates the attribute space which, in fact, has an impact on T＇s future responses, and then the category models are updated concurrently for the next run. We experience the weakly supervised algorithm on the real world datasets of faces and natural scenes in comparison with direct attribute prediction and semi-supervised learning approaches, and a noteworthy performance increase is achieved.

Architecture and algorithm for web phishing detection

A phishing detection system, which comprises client-side filtering plug-in, analysis center and protected sites, is proposed. An image-based similarity detection algorithm is conceived to calculate the similarity of two web pages. The web pages are first converted into images, and then divided into sub-images with iterated dividing and shrinking. After that, the attributes of sub-images including color histograms, gray histograms and size parameters are computed to construct the attributed relational graph（ARG）of each page. In order to match two ARGs, the inner earth mover＇s distances（EMD）between every two nodes coming from each ARG respectively are first computed, and then the similarity of web pages by the outer EMD between two ARGs is worked out to detect phishing web pages. The experimental results show that the proposed architecture and algorithm has good robustness along with scalability, and can effectively detect phishing.

Design Pattern Mining Using Graph Matching

The identification of design pattern instances is important for program understanding and software maintenance. Aiming at the mining of design patterns in existing systems, this paper proposes a subgraph isomorphism approach to discover several design patterns in a legacy system at a time. The attributed relational graph is used to describe design patterns and legacy systems. The sub-graph isomorphism approach consists of decomposition and composition process. During the decomposition process, graphs corresponding to the design patterns are decomposed into sub-graphs, some of which are graphs corresponding to the elemental design patterns. The composition process tries to get sub-graph isomorphism of the matched graph if sub-graph isomorphism of each subgraph is obtained. Due to the common structures between design patterns, the proposed approach can reduce the matching times of entities and relations. Compared with the existing methods, the proposed algorithm is not linearly dependent on the number of design pattern graphs. Key words design pattern mining - attributed relational graph - subgraph isomorphism CLC number TP 311.5 Foundation item: Supported by the National Natural Science Foundation of China (60273075) and the Science Foundation of Naval University of Engineering (HGDJJ03019)Biography: LI Qing-hua (1940-), male, Professor, research direction: parallel computing.

Generalized binary discernibility matrix for attribute reduction in incomplete information systems

To extract and express the knowledge hidden in information systems, discernibility matrix and its extensions were introduced and applied successfully in many real life applications. Binary discernibility matrix, as a representative approach, has many interesting superior properties and has been rapidly developed to find intuitive and easy to understand knowledge. However, at present, the binary discernibility matrix is mainly adopted in the complete information system. It is a challenging topic how to achieve the attribute reduction by using binary discernibility matrix in incomplete information system. A form of generalized binary discernibility matrix is further developed for a number of representative extended rough set models that deal with incomplete information systems. Some useful properties and criteria are introduced for judging the attribute core and attribute relative reduction. Thereafter, a new algorithm is formulated which supports attribute core and attribute relative reduction based on the generalized binary discernibility matrix. This algorithm is not only suitable for consistent information systems but also inconsistent information systems. The feasibility of the proposed methods was demonstrated by worked examples and experimental analysis.