Global ETD Search

Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.

Results

Showing 1 to 8 of 8 for “"Probabilistic Soft Logic"”.

  1. Hinge-Loss Markov Random Fields and Probabilistic Soft Logic: A Scalable Approach to Structured Prediction

    … structured and large scale, from social and biological networks, to knowledge graphs and the Web, to images, video, and natural language. In this thesis I introduce two new formalisms for modeling structured data, distinguished from previous approaches by their ability to both capture rich …

    maryland Repository record for Hinge-Loss Markov Random Fields and Probabilistic Soft Logic: A Scalable Approach to Structured Prediction (opens in a new tab)

  2. Forecasting Protests by Detecting Future Time Mentions in News and Social Media

    … phrase learning to identify what to look for, probabilistic soft logic to reason about location occurrences in extracted results, and time normalization to resolve future tense mentions. We illustrate the application of our system to 10 countries in Latin America, viz. Argentina, Brazil, Chile, …

    vt Repository record for Forecasting Protests by Detecting Future Time Mentions in News and Social Media (opens in a new tab)

  3. Automated Vocabulary Building for Characterizing and Forecasting Elections using Social Media Analytics

    … algorithm that builds a dynamic vocabulary using Probabilistic Soft Logic (PSL), a framework for probabilistic reasoning over relational domains. Using eight presidential elections from Latin America, we show how our query expansion methodology improves the performance of traditional election …

    vt Repository record for Automated Vocabulary Building for Characterizing and Forecasting Elections using Social Media Analytics (opens in a new tab)

  4. Social Network Data Management

    … inherent in social network querying, we define probabilistic subgraph matching queries over deterministic graph data and propose algorithms to answer them efficiently. Finally, we introduce a general relational machine learning framework and rule-based language, Probabilistic Soft Logic, to …

    maryland Repository record for Social Network Data Management (opens in a new tab)

  5. Natural language claims consistency checking using probabilistic reasoning with explanation

    … base, including against relations inferred via a logic system; the incremental building of a trusted knowledge base via a continuous learning technique, and the generation of explanations to facilitate users’ understanding of the system’s decisions. Consistency is checked using probabilistic soft …

    bristol Repository record for Natural language claims consistency checking using probabilistic reasoning with explanation (opens in a new tab) Download PDF for Natural language claims consistency checking using probabilistic reasoning with explanation (opens in a new tab)

  6. Natural language semantics using probabilistic logic

    … needed for a satisfactory representation. Logic-based representations like first-order logic capture many of the linguistic phenomena using logical constructs, and they come with standardized inference mechanisms, but standard first-order logic fails to capture the “graded” aspect of …

    texas Repository record for Natural language semantics using probabilistic logic (opens in a new tab)

  7. Intelligent Data Understanding for Entry, Descent, and Landing, Architecture Analysis

    … relational learning framework based on probabilistic soft logic to assess the degree of consistency of the rule with our knowledge of the system. We hypothesize that rules that are considered more consistent with the knowledge graph will be perceived by the user as being more …

    tamu Repository record for Intelligent Data Understanding for Entry, Descent, and Landing, Architecture Analysis (opens in a new tab)

  8. Security and Trust in Distributed Computation

    … the domains. To address this issue, we propose a probabilistic model to jointly infer multi-dimensional trust of workers, multi-domain properties of questions, and true labels of questions. Our model is very flexible and extensible to incorporate metadata associated with questions. To show that, …

    maryland Repository record for Security and Trust in Distributed Computation (opens in a new tab)