{"title":"Semantic web for net-enabled decision making","authors":"Y. Fattah","doi":"10.1145/1458484.1458493","DOIUrl":"https://doi.org/10.1145/1458484.1458493","url":null,"abstract":"The paper introduces a Semantic Web approach for net-enabled decision making. The Semantic Web ontology language OWL-DL is used to specify the vocabulary and relationships linking situational and decision making semantics for the decision domain. The knowledge is stored as an ontology library of templates where each template is a parameterized causal model fragment that can be instantiated to situation-specific Bayesian networks for course of action reasoning. Our semantic web approach allows semantic interoperability in joint distributed decision making with multiple information sources. The approach shortens the decision cycle and reduces the cognitive burden on the decision-maker. The paper illustrates the approach on a prototype application for course of action in military effects based operations.","PeriodicalId":363359,"journal":{"name":"Ontologies and Information Systems for the Semantic Web","volume":"37 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-10-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127137323","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Conflict ontology enrichment based on triggers","authors":"Chahnez Zakaria, Olivier Curé, K. Smaïli","doi":"10.1145/1458484.1458501","DOIUrl":"https://doi.org/10.1145/1458484.1458501","url":null,"abstract":"In this paper, we propose an ontology-based approach that enables to detect the emergence of relational conflicts between persons that cooperate on computer supported projects. In order to detect these conflicts, we analyze, using this ontology, the e-mails exchanged between these people.\u0000 Our method aims to inform project team leaders of such situation hence to help them in preventing serious disagreement between involved employees.\u0000 The approach we present builds a domain ontology of relational conflicts in two phases. First we conceptualize the domain by hand, then we enrich the ontology by using the trigger model that enables to find out terms in corpora which correspond to different conflicts.","PeriodicalId":363359,"journal":{"name":"Ontologies and Information Systems for the Semantic Web","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-10-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126515863","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Metric-based ontology learning","authors":"G. Yang, Jamie Callan","doi":"10.1145/1458484.1458486","DOIUrl":"https://doi.org/10.1145/1458484.1458486","url":null,"abstract":"Ontology learning is an important task in Artificial Intelligence, Semantic Web and Text Mining. This paper presents a novel framework for, and solutions to, three practical problems in ontology learning. An incremental clustering approach is used to solve the problem of unknown group names. Learned models at each level of an ontology address the problem of no control over concept abstractness. A metric learning module moves beyond the limitation of traditional use of features and incorporates heterogeneous semantic evidence into the learning process. The metric-based learning framework integrates these separate components into a single, unified solution. An extensive evaluation with WordNet and Open Directory Project data demonstrates that the method is more effective than a state-of-the-art baseline algorithm.","PeriodicalId":363359,"journal":{"name":"Ontologies and Information Systems for the Semantic Web","volume":"83 5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-10-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123278434","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"MashQL: a query-by-diagram topping SPARQL","authors":"Mustafa Jarrar, M. Dikaiakos","doi":"10.1145/1458484.1458499","DOIUrl":"https://doi.org/10.1145/1458484.1458499","url":null,"abstract":"This article is motivated by the importance of building web data mashups. Building on the remarkable success of Web 2.0 mashups, and specially Yahoo Pipes, we generalize the idea of mashups and regard the Internet as a database. Each internet data source is seen as a table, and a mashup is seen as a query on these tables. We assume that web data sources are represented in RDF, and SPARQL is the query language.\u0000 We propose a query-by-diagram language called MashQL. The goal is to allow people to build data mashups diagrammatically. In the background, MashQL queries are translated into and executed as SPARQL queries. The novelty of MashQL is that it allows querying a data source without any prior understanding of the schema or the structure of this source. Users also do not need any knowledge about RDF/SPARQL to get started.","PeriodicalId":363359,"journal":{"name":"Ontologies and Information Systems for the Semantic Web","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-10-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125101998","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Diego Calvanese, E. Kharlamov, W. Nutt, Camilo Thorne
{"title":"Aggregate queries over ontologies","authors":"Diego Calvanese, E. Kharlamov, W. Nutt, Camilo Thorne","doi":"10.1145/1458484.1458500","DOIUrl":"https://doi.org/10.1145/1458484.1458500","url":null,"abstract":"Answering queries over ontologies is an important issue for the Semantic Web. Aggregate queries were widely studied for relational databases but almost no results are known for aggregate queries over ontologies. In this work we investigate the latter problem. We propose syntax and semantics for epistemic aggregate queries over ontologies and study query answering for MAX, MIN, COUNT, CNTD, SUM, AVG queries for the ontology language DL-LiteA.","PeriodicalId":363359,"journal":{"name":"Ontologies and Information Systems for the Semantic Web","volume":"167 4","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-10-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114017864","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Frequent pattern-growth approach for document organization","authors":"Monika Akbar, R. Angryk","doi":"10.1145/1458484.1458496","DOIUrl":"https://doi.org/10.1145/1458484.1458496","url":null,"abstract":"In this paper, we propose a document clustering mechanism that depends on the appearance of frequent senses in the documents rather than on the co-occurrence of frequent keywords. Instead of representing each document as a collection of keywords, we use a document-graph which reflects a conceptual hierarchy of keywords related to that document. We incorporate a graph mining approach with one of the well-known association rule mining procedures, FP-growth, to discover the frequent subgraphs among the document-graphs. The similarity of the documents is measured in terms of the number of frequent subgraphs appearing in the corresponding document-graphs. We believe that our novel approach allows us to cluster the documents based more on their senses rather than the actual keywords.","PeriodicalId":363359,"journal":{"name":"Ontologies and Information Systems for the Semantic Web","volume":"33 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-10-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122789685","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"An interactive ontology learning workbench for non-experts","authors":"J. Gulla, V. Sugumaran","doi":"10.1145/1458484.1458487","DOIUrl":"https://doi.org/10.1145/1458484.1458487","url":null,"abstract":"Ontologies are an integral part of Knowledge and Information Management systems and there is increased interest in using ontologies for organizational memory. Ontology learning workbenches are used for semi-automatic learning of ontologies from representative text collections. This paper presents a new interactive workbench that gives the users more freedom in their ontology engineering process and frees them from knowing any ontology language syntax. The workbench is implemented as part of a search project, in which ontologies are used to search for movie information on the web. New techniques are steadily being added to the workbench, though early testing has already confirmed the validity of the ontology learning approach.","PeriodicalId":363359,"journal":{"name":"Ontologies and Information Systems for the Semantic Web","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-10-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117025733","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Learning the distance metric in a personal ontology","authors":"G. Yang, Jamie Callan","doi":"10.1145/1458484.1458488","DOIUrl":"https://doi.org/10.1145/1458484.1458488","url":null,"abstract":"Personal ontology construction is the task of sorting through relevant materials, identifying the main topics and concepts, and organizing them to suit personal needs. Automatic construction of personal ontologies is difficult in part because measuring the semantic distance between two concepts is difficult. Knowledge-based approaches use either knowledge bases, such as WordNet, or lexico-syntactic patterns to induce the differences between concepts. However, these techniques are only applicable for a subset of concepts and leave the majority unmeasurable. On the other hand, statistical approaches are able to induce the differences between any concept pair but lack of human knowledge involvement and hence suffer from low precision.\u0000 In the context of personal ontology construction, semantic distances between concepts need to reflect personal preferences. Based on that, this paper presents a supervised hierarchical clustering framework to incorporate personal preferences for distance metric learning in personal ontology construction. In this framework, periodic manual guidance provides training data for learning a distance metric and the learned metric is used during automatic activities to further construct the ontology. A detailed user study demonstrates that the approach is effective and accelerates the construction of personal ontologies.","PeriodicalId":363359,"journal":{"name":"Ontologies and Information Systems for the Semantic Web","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-10-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130503613","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Fault-tolerant semantic mappings among heterogeneous and distributed local ontologies","authors":"Abdul-Rahman Mawlood-Yunis","doi":"10.1145/1458484.1458490","DOIUrl":"https://doi.org/10.1145/1458484.1458490","url":null,"abstract":"Overcoming semantic mapping faults, i.e. semantic incompatibility, is a vital issue for the success of semantic-based peer-to-peer systems. There are various research efforts which address the classification and the resolution of the semantic mapping fault problem, i.e. translation errors. All of the precedent research related to semantic mapping faults demonstrates one significant shortcoming. This flaw is the inability to discriminate between non-permanent and permanent semantic mapping faults, i.e. how long do semantic incompatibilities stay effective and are the semantic incompatibilities permanent or temporary? The current research examines the destructive effect of semantic mapping faults on the Emerging Semantics, i.e. bottom-up construction of ontology and proposes a solution to detect temporal semantic mapping faults. The current research also demonstrates that fault-tolerant semantic mapping will result in Emerging Semantics which are more complete and agreeable than those domain ontologies that are built without consideration for fault-tolerant semantic mapping.","PeriodicalId":363359,"journal":{"name":"Ontologies and Information Systems for the Semantic Web","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-10-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129955959","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Data integration for the semantic web with full preferences","authors":"Olivier Curé","doi":"10.1145/1458484.1458495","DOIUrl":"https://doi.org/10.1145/1458484.1458495","url":null,"abstract":"This paper presents a tool that enables the integration of data stored in relational databases into Semantic Web compliant knowledge bases. The resulting knowledge bases are represented using Description Logics and can thus be translated into the Web Ontology language (OWL). Our approach tackles the impedance mismatch problem which is due to the storage of data in (relational) databases and objects in the knowledge bases. This problem is addressed with a mapping language that allows to specify how to transform data into objects. Another issue undertaken by our solution is related to inconsistencies emerging when contradicting values can be integrated into a given object. In order to deal with these inconsistencies, we enable users to set preferences over mapping views and their attributes. This approach provides a fine grained solution to design consistent knowledge bases.","PeriodicalId":363359,"journal":{"name":"Ontologies and Information Systems for the Semantic Web","volume":"39 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-10-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116615468","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}