A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2011; you can also visit the original URL.
The file type is
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 Dis-coveRy) System. Conkar is the first system for discovering constrained acyclic paths (CAP) in graph datadoi:10.1145/2063576.2064017 dblp:conf/cikm/ZhouPW11a fatcat:f7grdcgjojcobpfxo6opztmr3e