瞿裕忠
软件方法与技术、语义Web和万维网科学。
个性化签名
- 姓名:瞿裕忠
- 目前身份:
- 担任导师情况:
- 学位:
-
学术头衔:
博士生导师, 教育部“新世纪优秀人才支持计划”入选者
- 职称:-
-
学科领域:
计算机科学技术
- 研究兴趣:软件方法与技术、语义Web和万维网科学。
瞿裕忠,东南大学计算机学院教授,东南大学万维网科学研究所主任。分别于1985年和1988年从复旦大学取得数学专业的学士和硕士学位,于1995年从南京大学取得计算机软件专业的博士学位。2004年入选教育部 “新世纪优秀人才支持计划”。现任中国计算机学会系统软件专业委员会委员和软件工程专业委员会委员。先后担任全国软件与应用学术会议(NASAC)、亚洲语义Web会议(ASWC2006)和国际语义Web会议(ISWC2006)程序委员会委员。研究兴趣主要包括:软件方法与技术、语义Web和万维网科学。
先后承担包括江苏省基础研究计划项目、国家863课题、国家自然科学基金项目和国家973计划课题在内的多项科研项目。主持了本体匹配工具Falcons-AO和语义Web搜索引擎Falcons的研发。在万维网国际会议(WWW2006-2007)、语义Web国际会议(ISWC2005-2007)、《Journal of Computer and System Sciences》、《中国科学》和《Journal of Computer Science and Technology》等学术会议和学术期刊上有论文发表,已经发表学术论文50余篇。
-
主页访问
2132
-
关注数
0
-
成果阅读
802
-
成果数
16
【期刊论文】Ontology Summarization Based on RDF Sentence Graph
瞿裕忠, Xiang Zhang, Gong Cheng, Yuzhong Qu
,-0001,():
-1年11月30日
Ontology summarization is very important to quick understanding and selection of ontologies. In this paper, we study extractive summarization of ontology. We propose a notion of RDF sentence as the basic unit of summarization. An RDF Sentence Graph is proposed to characterize the links between RDF sentences derived from a given ontology. The salience of each RDF sentence is assessed in terms of its "centrality" in the graph. We propose to summarize an ontology by extracting a set of salient RDF sentences according to a re-ranking strategy. We compare several measurements in assessing the salience of RDF sentences and give an overall evaluation of experiment results, which shows that our approach to ontology summarization is feasible.
Ontology Summarization,, RDF Sentence,, RDF Sentence Graph,, Centrality,, Re-ranking
-
59浏览
-
0点赞
-
0收藏
-
0分享
-
131下载
-
0评论
-
引用
【期刊论文】Falcon-AO: Results for OAEI 2007
瞿裕忠, Wei Hu, Yuanyuan Zhao, Dan Li, Gong Cheng, Honghan Wu, and Yuzhong Qu
,-0001,():
-1年11月30日
In this paper, we present a brief overview of Falcon-AO (version 0.7): a practical ontology matching system with acceptable to very good performance, a flexible architecture, and a number of unique features. We also show some preliminary results of Falcon-AO for this year's OAEI campaign: evaluation on seven different matching tasks.
-
47浏览
-
0点赞
-
0收藏
-
0分享
-
79下载
-
0评论
-
引用
【期刊论文】Robust stability of stochastic delayed additive neural networks with Markovian switching
瞿裕忠, He Huanga, b, *, Daniel W.C. Hob, Yuzhong Quc
Neural Networks 20 (2007) 799-809,-0001,():
-1年11月30日
This paper is concerned with the problem of robust stability for stochastic interval delayed additive neural networks (SIDANN) with Markovian switching. The time delay is assumed to be time-varying. In such neural networks, the features of stochastic systems, interval systems, timevarying delay systems and Markovian switching are taken into account. The mathematical model of this kind of neural networks is first proposed. Secondly, the global exponential stability in the mean square is studied for the SIDANN with Markovian switching. Based on the Lyapunov method, several stability conditions are presented, which can be expressed in terms of linear matrix inequalities. As a subsequent result, the stochastic interval additive neural networks with time-varying delay are also discussed. A sufficient condition is given to determine its stability. Finally, two simulation examples are provided to illustrate the effectiveness of the results developed.
Additive neural networks, Stochastic systems, Interval systems, Time-varying delay systems, Markov chain, Global exponential stability
-
81浏览
-
0点赞
-
0收藏
-
0分享
-
116下载
-
0评论
-
引用
【期刊论文】Falcon-S: An Ontology-Based Approach to Searching Objects and Images in the Soccer Domain
瞿裕忠, Honghan Wu, Gong Cheng, and Yuzhong Qu
,-0001,():
-1年11月30日
While the Semantic Web technology has reached a considerable achievement, the main part of the Web is still far from semantic. To achieve semantic search on the current Web, we developed Falcon-S, a Semantic Web application which indexes soccer images semantically and provides ontology-driven searching and browsing mechanisms. Especially a graph-based user interface is provided to customize semantic queries for domain objects. In addition, the meanings of the image contents are captured and utilized to improve performance. From our experiments and the evaluations, it can be figured out that before the Semantic Web eventually creates order out of chaos on the Web, an ontology-driven approach applied to traditional search technology is a promising way to bring semantics to current Web in the searching area.
-
39浏览
-
0点赞
-
0收藏
-
0分享
-
219下载
-
0评论
-
引用
【期刊论文】Block Matching for Ontologies
瞿裕忠, Wei Hu and Yuzhong Qu
ISWC 2006, LNCS 4273, pp. 300-313, 2006.,-0001,():
-1年11月30日
Ontology matching is a crucial task to enable interoperation between Web applications using different but related ontologies. Today, most of the ontology matching techniques are targeted to find 1:1 mappings. However, block mappings are in fact more pervasive. In this paper, we discuss the block matching problem and suggest that both the mapping quality and the partitioning quality should be considered in block matching. We propose a novel partitioning-based approach to address the block matching issue. It considers both linguistic and structural characteristics of domain entities based on virtual documents, and uses a hierarchical bisection algorithm for partitioning. We set up two kinds of metrics to evaluate of the quality of block matching. The experimental results demonstrate that our approach is feasible.
-
35浏览
-
0点赞
-
0收藏
-
0分享
-
107下载
-
0评论
-
引用
【期刊论文】Partition-Based Block Matching of Large Class Hierarchies
瞿裕忠, Wei Hu, Yuanyuan Zhao, and Yuzhong Qu
ASWC 2006, LNCS 4185, pp. 72-83, 2006.,-0001,():
-1年11月30日
Ontology matching is a crucial task of enabling interoperation betweenWeb applications using different but related ontologies. Due to the size and the monolithic nature, large-scale ontologies regarding real world domains cause a new challenge to current ontology matching techniques. In this paper, we propose a method for partition-based block matching that is practically applicable to large class hierarchies, which are one of the most common kinds of large-scale ontologies. Based on both structural affinities and linguistic similarities, two large class hierarchies are partitioned into small blocks respectively, and then blocks from different hierarchies are matched by combining the two kinds of relatedness found via predefined anchors as well as virtual documents between them. Preliminary experiments demonstrate that the partitionbased block matching method performs well on our test cases derived from Web directory structures.
-
30浏览
-
0点赞
-
0收藏
-
0分享
-
53下载
-
0评论
-
引用
【期刊论文】Finding Important Vocabulary Within Ontology
瞿裕忠, Xiang Zhang, Hongda Li, and Yuzhong Qu
ASWC 2006, LNCS 4185, pp. 106-112, 2006.,-0001,():
-1年11月30日
In current Semantic Web community, some researches have been done on ranking ontologies, while very little is paid to ranking vocabularies within ontology. However, finding important vocabularies within a given ontology will bring benefits to ontology indexing, ontology understanding and even ranking vocabularies from a global view. In this paper, Vocabulary Dependency Graph (VDG) is proposed to model the dependencies among vocabularies within an ontology, and Textual Score of Vocabulary (TSV) is established based on the idea of virtual documents. And then a Double Focused PageRank algorithm is applied on VDG and TSV to rank vocabulary within ontology. Primary experiments demonstrate that our approach turns out to be useful in finding important vocabularies within ontology.
-
26浏览
-
0点赞
-
0收藏
-
0分享
-
52下载
-
0评论
-
引用
【期刊论文】Constructing Virtual Documents for Ontology Matching
瞿裕忠, Yuzhong Qu, Wei Hu, Gong Cheng
,-0001,():
-1年11月30日
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 reect the intended meaning of the URIref. Document similarity can be computed by traditional vector space techniques, and then be used in the similaritybased approaches to ontology matching. In particular, the RDF graph structure is exploited to dene 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.
Ontology Matching,, Linguistic Matching,, Des, c, r, i, p, t, ion Formulation,, Neighboring Operation,, Vector Space Model
-
41浏览
-
0点赞
-
0收藏
-
0分享
-
55下载
-
0评论
-
引用
【期刊论文】An RDF Storage and Query Framework with Flexible Inference Strategy
瞿裕忠, Wennan Shen and Yuzhong Qu
APWeb 2006, LNCS 3841, pp. 166-175, 2006.,-0001,():
-1年11月30日
In the Semantic Web, RDF (Resource Description Framework) and RDF Schema are commonly used to describe metadata. There are a great many RDF data in current web, therefore, efficient storage and retrieval of large RDF data sets is required. So far, several RDF storage and query system are developed. According to the inference strategy they used, they can be classified into two categories, one exclusively use forward chaining strategy; the other exclusively use backward chaining strategy. In most cases, the query performance of the former is superior to that of the latter. However, in some cases, the disadvantage of larger storage space may at some point outweigh the advantage of faster querying. Further, the existing systems that exclusively use forward chaining strategy have not yet presented a good solution to the deletion operation by now. In this paper, we design a RDF storage and query framework with flexible inference strategy, which can combine forward and backward chaining inference strategies. In addition, a new solution to the deletion operation is also given within our framework. The feasibility of our framework is illustrated by primary experiments.
-
26浏览
-
0点赞
-
0收藏
-
0分享
-
48下载
-
0评论
-
引用
【期刊论文】DynamicView: Distribution, Evolution and Visualization of Research Areas in Computer Science
瞿裕忠, Zhiqiang Gao, Yuzhong Qu, Yuqing Zhai, and Jianming Deng
ISWC 2005, LNCS 3729, pp. 1054-1058, 2005.,-0001,():
-1年11月30日
It is tedious and error-prone to query search engines manually in order to accumulate a large body of factual information. Search engines retrieve and rank potentially relevant documents for human perusal, but do not extract facts, or fuse information from multiple documents. This paper introduces DynamicView, a SemanticWeb application for researchers to query, browse and visualize distribution and evolution of research areas in computer science. Present and historical web pages of top 20 universities in USA and China are analyzed, and research areas of faculties in computer science are extracted automatically by segmentation based algorithm. Different ontologies of ACM and MST classification systems are combined by SKOS vocabularies, and the classification of research areas is learned from the ACM Digital Library. Query results including numbers of researchers and their locations are visualized in SVG map and animation. Interestingly, great differences of hot topics do exist between the two countries, and the number of researchers in certain areas changed greatly from the year 2000 to 2005.
-
40浏览
-
0点赞
-
0收藏
-
0分享
-
60下载
-
0评论
-
引用