A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Filters
Partitioning of ontologies driven by a structure-based approach
2015
Proceedings of the 2015 IEEE 9th International Conference on Semantic Computing (IEEE ICSC 2015)
Preserved Fulltext
In this paper, we propose a novel structure-based partitioning algorithm able to break a large ontology into different modules related to specific topics for the domain of interest. ...
about semantics of ontology relationships. ...
Exploiting such an idea, in this work we present a method for the structure-based partitioning of a large ontology into a set of topic-centered sub-modules. ...
doi:10.1109/icosc.2015.7050827
dblp:conf/semco/AmatoSMPPP15
fatcat:miohgeoyonebneyord66iq5ppi
On Matching Large Life Science Ontologies in Parallel
[chapter]
2010
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2013; you can also visit the original URL.
The file type is application/pdf.
Effective ontology matching, i.e. the computation of high quality mappings, typically entails the combined execution of several matchers to determine the similarity between ontology elements based on metadata ...
The large size of existing ontologies and the application of complex match strategies for obtaining high quality mappings makes ontology matching a resource-and time-intensive process. ...
This work is supported by the German Research Foundation (DFG), grant RA 497/18-1 ("Evolution of Ontologies and Mappings"). ...
doi:10.1007/978-3-642-15120-0_4
fatcat:nsyydk4xffgaxkorllgy3hhn2a
Criteria-based partitioning of large ontologies
2007
Proceedings of the 4th international conference on Knowledge capture - K-CAP '07
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
In the following, we investigate the partitioning of large ontologies into a set of interconnected modules based on structural quality criteria using the PATO tool. ...
PARTITIONING ALGORITHM In the following, we review the structure-based partitioning algorithm proposed in [6, 5] and propose a number of optimizations developed in the meantime. ...
doi:10.1145/1298406.1298439
dblp:conf/kcap/SchlichtS07
fatcat:wklkcb2y7jh7piehsrepaklxsu
Partition-Based Block Matching of Large Class Hierarchies
[chapter]
2006
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
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 third author of this paper is also supported by NCET (New Century Excellent Talents in University) Program under Grant NCET-04-0472. ...
doi:10.1007/11836025_8
fatcat:vj3o36sm7bh3xoovspr4a7ztxi
PSOM2—partitioning-based scalable ontology matching using MapReduce
2017
Sadhana (Bangalore)
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
We have designed a new neighbour-based intra-similarity measure to increase the quality of the cluster set formation for the partition-based ontology matching process. ...
One of the methods used to address this problem is the use of partition-based systems to reduce the matching space. ...
When an entity of a partition shares a similar structure with one of its neighbours, their computed intra-ontology similarity will be large. ...
doi:10.1007/s12046-017-0742-5
fatcat:d2mzytrwb5gs5a3en7oykmfiti
Structure-Based Partitioning of Large Concept Hierarchies
[chapter]
2004
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2005; you can also visit the original URL.
The file type is application/pdf.
In this paper, we suggest a similar approach for ontologies. We propose a method for automatically partitioning large ontologies into smaller modules based on the structure of the class hierarchy. ...
We show that the structure-based performs surprisingly well on real world ontologies. ...
Discussion In this paper we describe a method for structure-based ontology partitioning that is practically applicable to very large ontologies. ...
doi:10.1007/978-3-540-30475-3_21
fatcat:atwolct3mvhfrhaddq752fef5i
A Flexible Partitioning Tool for Large Ontologies
2008
2008 IEEE/WIC/ACM International Conference on Web Intelligence and Intelligent Agent Technology
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
In this paper we present a flexible partitioning tool for large ontologies that can be adapted to the needs of different applications based on criteria that the resulting modular ontology should satisfy ...
As most real world ontologies, however, are still designed in a monolithic way, there is a need for methods that partition an existing ontology into a set of modules. ...
Outline and Contribution In the following, we investigate the partitioning of large ontologies into a set of interconnected modules based on structural quality criteria using the PATO tool. ...
doi:10.1109/wiiat.2008.398
dblp:conf/webi/SchlichtS08
fatcat:2ar6l4sswfemxavtfnilizl66a
Parallel Markov-based Clustering Strategy for Large-scale Ontology Partitioning
2017
Proceedings of the 9th International Joint Conference on Knowledge Discovery, Knowledge Engineering and Knowledge Management
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
Parallel Markov-based Clustering Strategy for Large-scale Ontology Partitioning. ...
To this end, this paper proposes a novel approach for large-scale ontology partitioning through parallel Markov-based clustering strategy using Spark framework. ...
., (2008) develop a structure-based partitioning algorithm that firstly, partitions the entities of each ontology into a set of clusters based on their structural proximities, then, they construct blocks ...
doi:10.5220/0006504001950202
dblp:conf/ic3k/MountasserOF17
fatcat:7kco2r6qvfdedeeeujlxhstmgi
Matching large ontologies: A divide-and-conquer approach
2008
Data & Knowledge Engineering
Preserved Fulltext
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 application/pdf.
We develop a structure-based partitioning algorithm, which partitions entities of each ontology into a set of small clusters and constructs blocks by assigning RDF Sentences to those clusters. ...
Due to their sizes and monolithic nature, large ontologies regarding real world domains bring a new challenge to the state of the art ontology matching technology. ...
Acknowledgements This work is funded in part by the NSFC under Grant 60573083 and also in part by the 973 Program of China under Grant 2003CB317004. ...
doi:10.1016/j.datak.2008.06.003
fatcat:u32q6xgdmbbtvmg54kqkojjkya
Matching Large Scale Ontologies Based on Filter and Verification
2020
Mathematical Problems in Engineering
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
This paper proposes an innovative method of matching large scale ontologies based on filter and verification, which firstly reduces the heterogeneous of large scale ontologies in the filter phase and then ...
Large scale ontologies will be partitioned into several subontologies to get a proper scale before matching. ...
In this paper, a method of matching large-scale ontologies based on filter and verification is proposed, in which both source ontology and target ontology are partitioned into several subontologies firstly ...
doi:10.1155/2020/8107968
fatcat:ef4mzjeherhyrm757l2rc2q7ki
Alignment-Based Partitioning of Large-Scale Ontologies
[chapter]
2010
Studies in Computational Intelligence
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Results of experiments performed by the two methods on various pairs of ontologies are promising. ...
These methods transform the two ontologies to be aligned into two sets of blocks of a limited size. ...
Ontologies (http://geonto.lri.fr/) and through the WebContent project ANR RNTL. ...
doi:10.1007/978-3-642-00580-0_15
fatcat:qgxyko37obet7m7pbrp4cr5awm
Graph-based partitioning of ontology with semantic similarity
2013
ICCKE 2013
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Ontology partitioning is a good solution to overcome challenges of large ontologies such as reusability, scalability, complexity and maintenance. ...
The problem is that processing large ontologies consumes more time and space than processing only parts of ontologies. ...
In [7] , they constructed the weighted graph of ontology based on structural and linguistic similarities. ...
doi:10.1109/iccke.2013.6682869
fatcat:yr7bmgxt5ncn7gn2e362s4smcu
Ontology Partitioning: Clustering Based Approach
2015
International Journal of Information Technology and Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
In this work, we propose a revision and an enhancement of K-means clustering algorithm based on a new semantic similarity measure for partitioning given ontology into high quality modules. ...
Partitioning the ontology is the key solution to handle this scalability issue. ...
[13] present a method for automatically partitioning ontologies based on the structure of the class hierarchy. ...
doi:10.5815/ijitcs.2015.06.01
fatcat:57o25fximbgf7eujs2drxio4fm
Towards Large-Scale Schema and Ontology Matching
[chapter]
2010
Schema Matching and Mapping
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Large-scale matching needs especially be supported for XML schemas and different kinds of ontologies due to their increasing use and size, e.g. in e-business, web and life science applications. ...
Unfortunately, correctly and efficiently matching large schemas and ontologies is very challenging and most previous match systems have only addressed small match tasks. ...
Partition-based matching Partition-based matching is a divide-and-conquer strategy to first partition the input schemas / ontologies and then perform a partition-wise matching. ...
doi:10.1007/978-3-642-16518-4_1
fatcat:wyrqo2fmsrg6ldz7cpauq4axci
A Clustering-Based Approach for Large-Scale Ontology Matching
[chapter]
2011
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2013; you can also visit the original URL.
The file type is application/pdf.
In particular, we first introduce a structure-based clustering approach to partition each schema graph into a set of disjoint subgraphs (clusters). ...
Schema and ontology matching have attracted a great deal of interest among researchers. ...
Acknowledgements: This work is supported by the Federal Ministry of Education and Research (BMBF), grant 03FO2152 ("Web Data Integration"). ...
doi:10.1007/978-3-642-23737-9_30
fatcat:zku6egpckbdwtbev227rj7lc7y
« Previous
Showing results 1 — 15 out of 32,966 results