Gong Cheng

Gong Cheng

Auto-generated profile, based on publicly available information

Gong Cheng

State Key Laboratory for Novel Software Technology, Nanjing University, Nanjing, Jiangsu, China

Research Focus & Metrics

Academic Career Length

21Years (2006-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
1 October 2008 in Data & Knowledge Engineering
Verified
Journal Article
Closed access
WHWei Hu
Wei Hu
YQYuzhong Qu
Yuzhong Qu
GCGong Cheng
Gong Cheng

8 May 2007
Verified
Conference Paper
Open access
PDF file
XZXiang Zhang
Xiang Zhang
GCGong Cheng
Gong Cheng
YQYuzhong Qu
Yuzhong Qu

1 July 2009 in International Journal on Semantic Web and Information Systems
Verified
Journal Article
Closed access
PDF file
GCGong Cheng
Gong Cheng
YQYuzhong Qu
Yuzhong Qu
Along with the rapid growth of the data Web, searching linked objects for information needs and for reusing become emergent for ordinary Web users and developers, respectively. To meet the challenge, we present Falcons Object Search, a keyword-based search engine for linked objects. To serve various keyword queries, for each object the system constructs a comprehensive virtual document including not only associated literals but also the textual descriptions of associated links and linked objects. The resulting objects are ranked by considering both their relevance to the query and their popularity. For each resulting object, a query-relevant structured snippet is provided to show the associated literals and linked objects matched with the query. Besides, Web-scale class-inclusion reasoning is performed to discover implicit typing information, and users could navigate class hierarchies for incremental class-based results filtering. The results of a task-based experiment show the promising features of the system.

23 May 2006
Verified
Conference Paper
Open access
PDF file
YQYuzhong Qu
Yuzhong Qu
WHWei Hu
Wei Hu
GCGong Cheng
Gong Cheng
On the investigation of linguistic techniques used in ontology matching, we propose a new idea of virtual documents to pursue a cost-effective approach to linguistic matching in this paper. Basically, as a collection of weighted words, the virtual document of a URIref declared in an ontology contains not only the local descriptions but also the neighboring information to reflect the intended meaning of the URIref. Document similarity can be computed by traditional vector space techniques, and then be used in the similarity-based approaches to ontology matching. In particular, the RDF graph structure is exploited to define the description formulations and the neighboring operations. Experimental results show that linguistic matching based on the virtual documents is dominant in average F-Measure as compared to other three approaches. It is also demonstrated by our experiments that the virtual documents approach is cost-effective as compared to other linguistic matching approaches.

1 January 2011
Verified
Book Chapter
Closed access
PDF file
GCGong Cheng
Gong Cheng
TTThanh Tran
Thanh Tran
YQYuzhong Qu
Yuzhong Qu

14 May 2016
Verified
Book Chapter
Closed access
PDF file
KGKalpa Gunaratna
Kalpa Gunaratna
KTKrishnaprasad Thirunarayan
Krishnaprasad Thirunarayan
ASAmit Sheth
Amit Sheth
GCGong Cheng
Gong Cheng