Filters








1,895 Hits in 6.0 sec

Common Subsumbers in RDF [chapter]

Simona Colucci, Francesco M. Donini, Eugenio Di Sciascio
2013 Lecture Notes in Computer Science  
Since their definition in 1992, Least Common Subsumers (LCSs) have been identified as services supporting learning by examples.  ...  In order to support such a process, in this paper we give up to the subsumption minimality requirement of LCSs to meet the peculiarities of the dataset at hand and define Common Subsumers (CSs).  ...  finding (least or not) common subsumers has been defined and studied.  ... 
doi:10.1007/978-3-319-03524-6_30 fatcat:ably7ajq3ne4zpnzff3f2onqpm

Finding Commonalities in RFID Semantic Streams

Michele Ruta, Simona Colucci, Floriano Scioscia, Eugenio Di Sciascio, Francesco M. Donini
2011 Procedia Computer Science  
in them so allowing automated pattern analysis and trend discovery.  ...  It is possible to define a semantic stream as a time-ordered sequence of metadata, i.e., a concept stream.  ...  p, Informative k-Common Subsumers (IkCS) have been defined as a specific subset of k-CSs not subsuming all p concepts and then adding informative content to the LCS computation.  ... 
doi:10.1016/j.procs.2011.07.118 fatcat:qs4h2j66pfhildt66wx2qhnnzq

Finding Commonalities in Linked Open Data

Simona Colucci, Silvia Giannini, Francesco M. Donini, Eugenio Di Sciascio
2014 Italian Conference on Computational Logic  
The approach grounds on an algorithm for Common Subsumers computation proposed in a previous work of some of the authors.  ...  , in terms of (generalized) RDF triples.  ...  Acknoledgements We acknowledge support of projects "A Knowledge based Holistic Integrated Research Approach" (KHIRA -PON 02 00563 3446857) and "Enhance Risk Management through Extended Sensors" (ERMES  ... 
dblp:conf/cilc/ColucciGDS14 fatcat:4f2wdzy2ebfapgctpu6rnc2avq

From Meaningful Orderings in the Web of Data to Multi-level Pattern Structures [chapter]

Quentin Brabant, Miguel Couceiro, Amedeo Napoli, Justine Reynaud
2017 Lecture Notes in Computer Science  
This formalism is compatible with ontologies formulated in the language of RDF and RDFS and aims to set up a framework based on pattern structures for knowledge discovery in the web of data.  ...  We define a pattern structure whose objects are elements of a supporting ontology.  ...  This enables us to define a similarity (or meet) operator by, for a, b ∈ X, a b is the least common subsumer of a and b.  ... 
doi:10.1007/978-3-319-60438-1_61 fatcat:4vxkvvquvfcztcbzkah4rceeoy

Interactive exploration over RDF data using formal concept analysis

Mehwish Alam, Amedeo Napoli
2015 2015 IEEE International Conference on Data Science and Advanced Analytics (DSAA)  
It takes RDF triples and RDF Schema based on user requirements and provides one navigation space resulting from several RDF resources.  ...  With an increased interest in machine processable data, many datasets are now published in RDF (Resource Description Framework) format in Linked Data Cloud.  ...  Definition 4 (Least Common Subsumer): Given a partially ordered set pS, ĺq, a least common subsumer E of two classes C and D (lcs(C,D) for short) in a partially ordered set is a class such that C ĺ E and  ... 
doi:10.1109/dsaa.2015.7344838 dblp:conf/dsaa/AlamN15 fatcat:gzujmskkdzc5toz5vqaio7k2qu

RDFBroker: A Signature-Based High-Performance RDF Store [chapter]

Michael Sintek, Malte Kiesel
2006 Lecture Notes in Computer Science  
Our approach can be used for both in-memory and on-disk relational database-based RDF store implementations.  ...  Many approaches for RDF stores exist, most of them using very straight-forward techniques to store triples in or mapping RDF Schema classes to database tables.  ...  This work has been supported in part by the SmartWeb project, which is funded by the German Ministry of Education and Research under grant 01 IMD01 A, and by the NEWS project, which is funded by the IST  ... 
doi:10.1007/11762256_28 fatcat:rcfejzojivfx7iyc7m2wxurgai

A Proposal for Classifying the Content of the Web of Data Based on FCA and Pattern Structures [chapter]

Justine Reynaud, Mehwish Alam, Yannick Toussaint, Amedeo Napoli
2017 Lecture Notes in Computer Science  
Acknowledgments This work has been conducted with the support of "Région Lorraine" and "Délégation Générale de l'Armement".  ...  Definition 2 (Least common subsumer). Given a tree (H, ), the least common subsumer of two nodes x and y of that tree is the node z s.t. x z, y z, ∃ z 1 z s.t. x z 1 and y z 1 .  ...  We can now define the similarity operator as ∀(p i1 , o j1 ) ∈ δ(s 1 ), ∀(p i2 , o j2 ) ∈ δ(s 2 ): δ(s 1 ) δ(s 2 ) = min{(lcs E (p i1 , p i2 ), lcs V (o j1 , o j2 ))} where lcs is the least common subsumer  ... 
doi:10.1007/978-3-319-60438-1_67 fatcat:ucdxvum57vhfpanusv224ia62a

A Proposal for Annotation, Semantic Similarity and Classification of Textual Documents [chapter]

Emmanuel Nauer, Amedeo Napoli
2006 Lecture Notes in Computer Science  
In this paper, we present an approach for classifying documents based on the notion of a semantic similarity and the effective representation of the content of the documents.  ...  The content of a document is annotated and the resulting annotation is represented by a labeled tree whose nodes and edges are represented by concepts lying within a domain ontology.  ...  annotation tree denoted by A S (A 1 , A 2 ) = (N, E) that is the least common subsumer of A 1 and A 2 .  ... 
doi:10.1007/11861461_22 fatcat:mnjs2omo7jgj7gsjaez2mtnnxm

Views for light-weight Web ontologies

Raphael Volz, Daniel Oberle, Rudi Studer
2003 Proceedings of the 2003 ACM symposium on Applied computing - SAC '03  
This paper addresses this issue and presents a new view mechanism for the data models underlying the Semantic Web, RDF and RDFS.  ...  However, ontologies and thereby ontology-based applications themselves suffer from heterogeneity.  ...  The view itself is subsumed by the least common superentity of all unified entities. For the intersection operator the opposite fact hold.  ... 
doi:10.1145/952532.952760 dblp:conf/sac/VolzOSS03 fatcat:pckae4v7nndhpahajwygjpapim

Views for light-weight Web ontologies

Raphael Volz, Daniel Oberle, Rudi Studer
2003 Proceedings of the 2003 ACM symposium on Applied computing - SAC '03  
This paper addresses this issue and presents a new view mechanism for the data models underlying the Semantic Web, RDF and RDFS.  ...  However, ontologies and thereby ontology-based applications themselves suffer from heterogeneity.  ...  The view itself is subsumed by the least common superentity of all unified entities. For the intersection operator the opposite fact hold.  ... 
doi:10.1145/952756.952760 fatcat:ho6dska3lvfx3c3wfqo57a6nc4

An Approach Towards Classifying and Navigating RDF data based on Pattern Structures

Mehwish Alam, Amedeo Napoli
2015 International Conference on Formal Concept Analysis  
With an increased interest in machine processable data, more and more data is now published in RDF (Resource Description Framework) format.  ...  This RDF data is present in independent and distributed resources which needs to be centralized, navigated and searched for domain specific applications.  ...  Here we re-write the definition of a least common subsumer of two classes in a RDF Schema T given in [9] . Definition 2 (Least Common Subsumer).  ... 
dblp:conf/icfca/AlamN15 fatcat:7figtxdpr5bbhb6jxf2if732b4

On enhancing scalability for distributed RDF/S stores

George Tsatsanifos, Dimitris Sacharidis, Timos Sellis
2011 Proceedings of the 14th International Conference on Extending Database Technology - EDBT/ICDT '11  
More importantly, MIDAS-RDF utilizes a labeling scheme to handle expensive transitive closure computations efficiently.  ...  MIDAS-RDF features fast retrieval of RDF triples satisfying various pattern queries by translating them into multi-dimensional range queries, which can be processed by the underlying index in hops logarithmic  ...  Furthermore, given two nodes u and w, their nearest common ancestor is the node labeled with their longest common prefix, which can be easily computed in O(min{ label(u) , label(w) }), where label(u) denotes  ... 
doi:10.1145/1951365.1951384 dblp:conf/edbt/TsatsanifosSS11 fatcat:nuhgdo54pbgxrnllxlsd4mxiuu

An ontology for context-aware pervasive computing environments

HARRY CHEN, TIM FININ, ANUPAM JOSHI
2003 Knowledge engineering review (Print)  
Ontologies are a key component for building open and dynamic distributed pervasive computing systems in which agents and devices share contextual information.  ...  It provides a vocabulary of terms for classes and properties suitable for building practical systems that model context in pervasive computing environments.  ...  Key design requirements are common to the web and pervasive computing.  ... 
doi:10.1017/s0269888904000025 fatcat:fp6kzi26gvbutiuxdeqjyojn5m

Learning Commonalities in RDF [chapter]

Sara El Hassad, François Goasdoué, Hélène Jaudoin
2017 Lecture Notes in Computer Science  
Finding the commonalities between descriptions of data or knowledge is a foundational reasoning problem of Machine Learning introduced in the 70's, which amounts to computing a least general generalization  ...  The RDF standard [31] provides built-in classes and properties, as URIs within the rdf and rdfs pre-defined namespaces, e.g., rdf:type which can be used to state that the above b is a conference paper  ...  Since the early 90's, this problem has also received consideration in the Knowledge Representation field, where least general generalizations were rebaptized least common subsumers [12] , in Description  ... 
doi:10.1007/978-3-319-58068-5_31 fatcat:gftpictqnrfs5ciwzbbthderpy

A New Similarity Measure Based On Edge Counting

T. Slimani, B. Ben Yaghlane, K. Mellouli
2008 Zenodo  
The obtained results show that compared to the Wu and Palmer approach, our measure presents a profit in terms of relevance and execution time.  ...  In the field of concepts, the measure of Wu and Palmer [1] has the advantage of being simple to implement and have good performances compared to the other similarity measures [2].  ...  The measure of [1] is interesting but presents a limit because it primarily aims to detect the similarity between two concepts compared to the distance of their least common subsumer.  ... 
doi:10.5281/zenodo.1075129 fatcat:iz3lpw2d5nepdcil2fboqmfdye
« Previous Showing results 1 — 15 out of 1,895 results