PhD Thesis Proposal Defence


"Correlation Search in Graph Databases"

by

Miss Yiping Ke


Abstract:

Correlation mining has gained great success in many application domains
for its ability to capture the underlying dependency between objects.
However, the research of correlation mining from graph databases is still
lacking despite the fact that graph data, especially in various scientific
domains, proliferate in recent years. Correlation mining from graph
databases poses two challenges. First, the number of candidate graphs is
exponential. Second, graph operations such as subgraph isomorphism testing
are expensive. In this proposal, we propose an efficient solution to the
problem. Specifically, we propose to effectively generate the candidate
set from the projected database of the query graph. Three heuristic rules
are developed and applied to the candidate set to further reduce the
search space. Preliminary results are presented and some on-going plans
are discussed.


Date:     		Thursday, 5 July 2007

Time:                   2:00p.m.-4:00p.m.

Venue:                  Room 3501
			lifts 25-26

Committee Members:      Dr. Wilfred Ng (Supervisor)
                        Prof. Qiang Yang (Chairperson)
			Prof. Dik-Lun Lee
			Dr. Qiong Luo


**** ALL are Welcome ****