Querying P2P Networks via FCA Granularity

MPhil Thesis Defence


Title: "Querying P2P Networks via FCA Granularity"

By

Mr. Man Ki FUNG


Abstract

The staple of information retrieval has been best-match retrieval. Its 
weakness is in differentiating nonmatching items. We introduce Formal 
Concept Analysis (FCA) and concept lattice-based ranking, showing how this 
method is able to install order on objects of retrieval that would 
otherwise be rendered irrelevant. We show an efficient algorithm based on 
concept lattice-based ranking to process query on concepts and demonstrate 
with experimental results. Furthermore, based on a recent algorithm on 
attribute granularity, we apply the query method to a dataset in a 
peer-to-peer (P2P) setting to demonstrate its performance with 
experimental results. The study is based on a field work. Our 
contributions is mainly in demonstrating the utility of FCA in information 
retrieval, pointing to possible design reorientation of search systems to 
take advantage of concept-based ranking.


Date:			Tuesday, 26 August 2014

Time:			11:00am - 1:00pm

Venue:			Room 4483
 			Lifts 25/26

Committee Members:	Prof. Dik-Lun Lee (Supervisor)
 			Dr. Raymond Wong (Chairperson)
 			Dr. Lin Gu


**** ALL are Welcome ****