Full metadata record
| DC Field | Value | Language |
|---|---|---|
| dc.contributor | Department of Computing | en_US |
| dc.creator | Wang, Jianguo | - |
| dc.identifier.uri | https://theses.lib.polyu.edu.hk/handle/200/7020 | - |
| dc.language | English | en_US |
| dc.publisher | Hong Kong Polytechnic University | - |
| dc.rights | All rights reserved | en_US |
| dc.title | Group-based techniques for identifying top-k degrees in hidden bipartite graphs | en_US |
| dcterms.abstract | Graphs are of fundamental importance in modeling data in various domains. Usually, graphs have both their vertices and edges available, which we refer to as explicit graphs. However, in applications such as bioinfomatics, graphs may only have vertices available (e.g., proteins), while the edges are unknown initially (e.g., interactions among proteins), which are called hidden graphs. Thus, the edge probe tests (e.g., biological experiments) are required to detect the presence of edges. This work studies the kMCV (k most connected vertices) problem on a hidden bipartite graph G(B, W) where B and W are two independent vertex sets. The kMCV problem aims to find the top k vertices in B that have the maximum degrees. It has applications in spatial databases, graph databases, and bioinformatics. There is a prior work on the kMCV problem, which is based on the "2-vertex test" model, i.e., an edge probe test can only reveal the existence of an edge between two individual vertices. We study the kMCV problem, in the context of a more general edge probe test model called "group test". A group test can reveal whether there exists some edge between a vertex and a group of vertices. If the group test model is used properly, a single invocation of a group test can reveal as much information as multiple invocations of 2-vertex tests. We discuss the cases and applications where the group test model could be used, and make the following contributions. 1. We propose an algorithm, namely, GMCV, that adaptively leverages the group test model to solve the kMCV problem. 2. We derive cost models for our algorithm GMCV and the prior algorithm. 3. We conduct extensive experiments on both synthetic and real life datasets, and show that our GMCV outperforms the prior algorithm significantly. | en_US |
| dcterms.extent | xvi, 69 p. : ill. ; 30 cm. | en_US |
| dcterms.isPartOf | PolyU Electronic Theses | en_US |
| dcterms.issued | 2013 | en_US |
| dcterms.educationalLevel | All Master | en_US |
| dcterms.educationalLevel | M.Phil. | en_US |
| dcterms.LCSH | Bipartite graphs. | en_US |
| dcterms.LCSH | Hong Kong Polytechnic University -- Dissertations | en_US |
| dcterms.accessRights | open access | en_US |
Files in This Item:
| File | Description | Size | Format | |
|---|---|---|---|---|
| b26160493.pdf | For All Users | 1.31 MB | Adobe PDF | View/Open |
Copyright Undertaking
As a bona fide Library user, I declare that:
- I will abide by the rules and legal ordinances governing copyright regarding the use of the Database.
- I will use the Database for the purpose of my research or private study only and not for circulation or further reproduction or any other purpose.
- I agree to indemnify and hold the University harmless from and against any loss, damage, cost, liability or expenses arising from copyright infringement or unauthorized usage.
By downloading any item(s) listed above, you acknowledge that you have read and understood the copyright undertaking as stated above, and agree to be bound by all of its terms.
Please use this identifier to cite or link to this item:
https://theses.lib.polyu.edu.hk/handle/200/7020