Sciweavers

25
Voted
CIKM
2011
Springer

Conkar: constraint keyword-based association discovery

12 years 7 months ago
Conkar: constraint keyword-based association discovery
In many domains, such as bioinformatics, cheminformatics, health informatics and social networks, data can be represented naturally as labeled graphs. To address the increasing needs in discovering interesting associations between entities in such data graphs, especially under complicated keyword-based and structural constraints, we introduce Conkar (Constrained Keyword-based Association DiscoveRy) System. Conkar is the first system for discovering constrained acyclic paths (CAP) in graph data under keyword-based constraints, with the highlight being the set of quantitative constraint metrics that we proposed, including coverage and relevance. We will demonstrate the key features of Conkar: powerful and userfriendly query specification, efficient query evaluation, flexible and on-demand result ranking, visual result display, as well as an insight tour on our novel CAP query evaluation algorithms. Categories and Subject Descriptors H.3.3 [Information Systems]: Information Storage a...
Mo Zhou, Yifan Pan, Yuqing Wu
Added 13 Dec 2011
Updated 13 Dec 2011
Type Journal
Year 2011
Where CIKM
Authors Mo Zhou, Yifan Pan, Yuqing Wu
Comments (0)