ABSTRACT
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.
- B. Aleman-Meza, et al. Semantic Analytics on Social Networks: Experiences in Addressing the Problem of Conflict of Interest Detection. In WWW, 2006. Google ScholarDigital Library
- F. Alkhateeb, et al. Constrained Regular Expressions in SPARQL. In SWWS, 2008.Google Scholar
- K. Anyanwu, et al. p-Queries: Enabling Querying for Semantic Associations on the Semantic Web. In WWW, 2003. Google ScholarDigital Library
- K. Anyanwu, et al. SPARQ2L: Towards Support for Subgraph Extraction Queries in RDF Databases. In WWW, 2007. Google ScholarDigital Library
- C. Bin, et al. Chem2Bio2RDF: a Semantic Framework for Linking and Data Mining Chemogenomic and Systems Chemical Biology Data. In BMC Bioinformatics, 2010.Google Scholar
- Y. Ding, et al. Semantic Web Portal: A Platform for Better Browsing and Visualizing Semantic Data. In AMT, 2010. Google ScholarDigital Library
- H. He, et al. BLINKS: Ranked Keyword Searches on Graphs. In SIGMOD, 2007. Google ScholarDigital Library
- R. Jin, et al. Computing Label Constraint Reachability in Graph Databases. In SIGMOD, 2010. Google ScholarDigital Library
- K. Kochut, et al. SPARQLeR: Extended SPARQL for Semantic Association Discovery. In ESWC, 2007. Google ScholarDigital Library
- S. Lee, et al. Building the Process-drug-side Effect Network to Discover the Relationship Between Biological Processes and Side Effects. In BMC Bioinformatics, 2011.Google ScholarCross Ref
- F. Manola, et al. RDF Primer. W3C Recommendation, 2004.Google Scholar
- E. Prud'hommeaux, et al. SPARQL Query Language for RDF. W3C Recommendation, 2008.Google Scholar
- M. Zhou, et al. Efficient Association Discovery with Keyword-based Constraints on Large Graph Data. In CIKM, 2011. Google ScholarDigital Library
- Conkar: http://www.cs.indiana.edu/~mozhou/conkar.htmlGoogle Scholar
Index Terms
Conkar: constraint keyword-based association discovery
Recommendations
Efficient association discovery with keyword-based constraints on large graph data
CIKM '11: Proceedings of the 20th ACM international conference on Information and knowledge managementIn many domains, such as social networks and chem-informatics, data can be represented naturally in graph model, with nodes being data entries and edges the relationships between them. We study the application requirements in these domains and find that ...
Intent-based diversification of web search results: metrics and algorithms
We study the problem of web search result diversification in the case where intent based relevance scores are available. A diversified search result will hopefully satisfy the information need of user-L.s who may have different intents. In this context, ...
Evaluating implicit judgments from image search clickthrough data
The interactions of users with search engines can be seen as implicit relevance feedback by the user on the results offered to them. In particular, the selection of results by users can be interpreted as a confirmation of the relevance of those results, ...
Comments