Sucheta Ghosh, Sara Tonelli, G. Riccardi, Richard Johansson
{"title":"End-to-End Discourse Parser Evaluation","authors":"Sucheta Ghosh, Sara Tonelli, G. Riccardi, Richard Johansson","doi":"10.1109/ICSC.2011.40","DOIUrl":"https://doi.org/10.1109/ICSC.2011.40","url":null,"abstract":"We are interested in the problem of discourse parsing of textual documents. We present a novel end-to-end discourse parser that, given a plain text document in input, identifies the discourse relations in the text, assigns them a semantic label and detects discourse arguments spans. The parsing architecture is based on a cascade of decisions supported by Conditional Random Fields (CRF). We train and evaluate three different parsers using the PDTB corpus. The three system versions are compared to evaluate their robustness with respect to deep/shallow and automatically extracted syntactic features.","PeriodicalId":408382,"journal":{"name":"2011 IEEE Fifth International Conference on Semantic Computing","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-09-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125653930","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":"Social Interactions Representation as Users Behavioral Contingencies and Evaluation in Social Networks","authors":"Alan Keller Gomes, M. Pimentel","doi":"10.1109/ICSC.2011.103","DOIUrl":"https://doi.org/10.1109/ICSC.2011.103","url":null,"abstract":"In social network analysis, models for the representation of user's interactions do not explain which actions are performed during social interactions, and which types of media are used in the interactions. We present a novel technique for the representation of social interactions as users' behavioral contingencies in the form of if-then rules, and for the evaluation of the contingencies using data mining procedures. We present the results of applying our technique in a group of Facebook users, identifying the social interactions in which users were more involved the most.","PeriodicalId":408382,"journal":{"name":"2011 IEEE Fifth International Conference on Semantic Computing","volume":"1757 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-09-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127454910","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}
M. Nodine, R. Grimshaw, Peter P. Haglich, Steven M. Wilder, J. B. Lyles
{"title":"Computational Asset Description for Cyber Experiment Support Using OWL","authors":"M. Nodine, R. Grimshaw, Peter P. Haglich, Steven M. Wilder, J. B. Lyles","doi":"10.1109/ICSC.2011.83","DOIUrl":"https://doi.org/10.1109/ICSC.2011.83","url":null,"abstract":"Performing repeatable and controlled cyber experiments requires the precise description of hardware, software and testbed assets used during an experiment. An experiment specifies the assets that are required to build the system under test and the experimental framework. Different assets must be specified at different levels of detail to ensure experimental coherence and repeatability. This paper describes the family of asset description ontologies that is used in the National Cyber Range (NCR). This family of ontologies is used to characterize software and hardware assets used during cyber experiments. We also describe how these ontologies are used for different aspects of defining, setting up, executing, and analyzing the results of experiments, and indicate how they can be used for more general-purpose applications.","PeriodicalId":408382,"journal":{"name":"2011 IEEE Fifth International Conference on Semantic Computing","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-09-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132996506","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":"Summarizing Large News Video Archives by Event Ranking","authors":"Duy-Dinh Le, S. Satoh","doi":"10.1109/ICSC.2011.91","DOIUrl":"https://doi.org/10.1109/ICSC.2011.91","url":null,"abstract":"We present an approach to extract and rank important events in large news video archives. Our approach relies on the assumption that frequent patterns occurring in the large video datasets might correspond to important events. We propose a method to automatically find, analyze, and associate frequent patterns to events in the video datasets. This problem is challenging because: firstly, the event boundary is unknown and large variations in illumination, camera motion, occlusions, and text overlays make it difficult to select appropriate features for event representation. Secondly, the number of frequent patterns is usually large, a method to rank them is required for applications such as recommendation and summarization. Thirdly, large datasets require scalable methods to handle. The novelty of the proposed method is that temporal information is used to rank frequent patterns and that scalable methods from video processing and data mining are integrated seamlessly to handle large datasets. Experimental results on 2,768 news video programs (approx. 1,400 hours of video) broadcast by NHK from 2001 to 2008 show that the method can find important events for summarization and is scalable on large datasets.","PeriodicalId":408382,"journal":{"name":"2011 IEEE Fifth International Conference on Semantic Computing","volume":"72 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-09-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133839389","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":"Access control via lightweight ontologies","authors":"Fausto Giunchiglia, B. Crispo, Rui Zhang","doi":"10.1109/ICSC.2011.23","DOIUrl":"https://doi.org/10.1109/ICSC.2011.23","url":null,"abstract":"The paper presents Relation Based Access Control RelBAC, a model and a logic for access control which models communities, possibly nested, and resources, possibly organized inside complex file systems, as lightweight ontologies, and permissions as relations between subjects and objects. RelBAC allows us to represent expressive access control rules beyond the current state of the art, and to deal with the strong dynamics of subjects, objects and permissions which arise in Web 2.0 applications (e.g. social networks). Finally, as shown in the paper, using RelBAC, it becomes possible to reason about access control policies and, in particular to compute candidate permissions by matching subject ontologies (representing their interests) with resource ontologies (describing their characteristics).","PeriodicalId":408382,"journal":{"name":"2011 IEEE Fifth International Conference on Semantic Computing","volume":"38 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-09-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115278511","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":"Predicting Missing Provenance Using Semantic Associations in Reservoir Engineering","authors":"Jing Zhao, K. Gomadam, V. Prasanna","doi":"10.1109/ICSC.2011.42","DOIUrl":"https://doi.org/10.1109/ICSC.2011.42","url":null,"abstract":"Provenance is becoming an important issue as a reliable estimator of data quality. However, provenance collection mechanisms in the reservoir engineering domain often result in missing provenance information. In this paper, we address the problem of predicting missing provenance information in reservoir engineering. Based on the observation that data items with specific semantic \"connections\" may share the same provenance, our approach annotates data items with domain entities defined in a domain ontology, and represent these \"connections\" as sequences of relationships (also known as semantic associations) in the ontology graph. By analyzing annotated historical datasets with complete provenance information, we capture semantic associations that may imply identical provenance. A statistical analysis is applied to assign confidence values to the discovered associations, which indicate the trust of each association when it is used for future provenance prediction. The semantic associations, along with their confidence measures, are then used by a voting algorithm to predict the missing provenance information. Our evaluation shows that the average precision of our approach is above 85% when one third of the provenance information is missing.","PeriodicalId":408382,"journal":{"name":"2011 IEEE Fifth International Conference on Semantic Computing","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-09-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124102157","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 Temporal Information for States and Events","authors":"Zornitsa Kozareva, E. Hovy","doi":"10.1109/ICSC.2011.94","DOIUrl":"https://doi.org/10.1109/ICSC.2011.94","url":null,"abstract":"Knowing the typical duration of events (for example, hurricanes last hour or days but not seconds or years) supports a variety of tasks in automated machine reading. Recently, methods to learn these durations for a limited class have been reported. However, events are associated with several other typical times, such as initiation points and preparation intervals. In this paper we define six temporally related aspects of events. We describe an automated method to learn events from the web and patterns that signal the typical temporal characteristics of the events. Finally, we show which patterns tend to signal which aspects. This diversity of event types, temporal aspects, and time characteristics has never yet been reported.","PeriodicalId":408382,"journal":{"name":"2011 IEEE Fifth International Conference on Semantic Computing","volume":"91 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-09-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116307953","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":"Developing Probabilistic Models for Identifying Semantic Patterns in Texts","authors":"Minhua Huang, R. Haralick","doi":"10.1109/ICSC.2011.35","DOIUrl":"https://doi.org/10.1109/ICSC.2011.35","url":null,"abstract":"We present a probabilistic graphical model that finds a sequence of optimal categories for a sequence of input symbols. Based on this mode, three algorithms are developed for identifying semantic patterns in texts. They are the algorithm for extracting semantic arguments of a verb, the algorithm for classifying the sense of an ambiguous word, and the algorithm for identifying noun phrases from a sentence. Experiments conducted on standard data sets show good results. For example, our method achieves an average precision of 92:96% and an average recall of 94:94% for extracting semantic argument boundaries of verbs on WSJ data from Penn Tree bank and Prop Bank, an average accuracy of 81:12% for recognizing the six sense word 0line0, and an average precision of 97:7% and an average recall of 98:8% for recognizing noun phrases on WSJ data from Penn Tree bank.","PeriodicalId":408382,"journal":{"name":"2011 IEEE Fifth International Conference on Semantic Computing","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-09-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120956167","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":"Approaches for Real-Time Integration of Semantic Web Data in Distributed Enterprise Systems","authors":"Maciej Dabrowski, K. Griffin, Alexandre Passant","doi":"10.1109/ICSC.2011.84","DOIUrl":"https://doi.org/10.1109/ICSC.2011.84","url":null,"abstract":"The widespread use of social platforms in contemporary organizations leads to the generation of large amount of content shared through various social tools. While Semantic Web technologies provide data integration capabilities the two major remaining challenges include real-time integration of social data and limit the information overload experienced by the knowledge workers through content personalization. This paper focuses on the former and presents a comparison of current practices in real-time integration of RDF data and their performance. We give an overview of popular architectural approaches and existing RDF update formats used for modeling changes in RDF data.","PeriodicalId":408382,"journal":{"name":"2011 IEEE Fifth International Conference on Semantic Computing","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-09-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125219419","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":"Searching the 'Web of Things'","authors":"B. Christophe, Vincent Verdot, V. Toubiana","doi":"10.1109/ICSC.2011.69","DOIUrl":"https://doi.org/10.1109/ICSC.2011.69","url":null,"abstract":"With the proliferation of connected devices and the widespread adoption of the Web, ubiquitous computing success has recently been brought into the fashion of an emergent paradigm called the 'Web of Things', where Web-enabled objects are offered through interconnected smart spaces. While some predict a near future with billions of Web-enabled objects, the success of this vision now depends on the creation of efficient processes and the availability of tools enabling users or applications to find connected objects matching a set of requirements (and expectations). We present an on-going work that aims to develop a search process dedicated to the 'Web of Things' and that relies on three contributions. The creation and use of semantic profiles for connected objects, the establishment of similarities between semantic profiles of different connected objects to gather them into clusters and, the computation of a score associating a 'context of search' to an incoming request and enabling the selection of the most appropriate search algorithms, involving either probabilistic or precise reasoning.","PeriodicalId":408382,"journal":{"name":"2011 IEEE Fifth International Conference on Semantic Computing","volume":"71 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-09-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127276039","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}