02855nas a2200277 4500008004100000245005400041210005400095520195300149653003302102653002302135653003302158653001502191653001502206100002802221700003402249700001902283700002002302700001602322700002802338700003202366700002102398700001702419700002302436700002002459856009802479 2020 eng d00aMultimodal mental health analysis in social media0 aMultimodal mental health analysis in social media3 a

p.p1 {margin: 0.0px 0.0px 0.0px 0.0px; font: 9.5px Helvetica}

Depression is a major public health concern in the U.S. and globally. While successful early

identification and treatment can lead to many positive health and behavioral outcomes,

depression, remains undiagnosed, untreated or undertreated due to several reasons,

including denial of the illness as well as cultural and social stigma. With the ubiquity of social

media platforms, millions of people are now sharing their online persona by expressing their

thoughts, moods, emotions, and even their daily struggles with mental health on social

media. Unlike traditional observational cohort studies conducted through questionnaires

and self-reported surveys, we explore the reliable detection of depressive symptoms from

tweets obtained, unobtrusively. Particularly, we examine and exploit multimodal big (social)

data to discern depressive behaviors using a wide variety of features including individuallevel

demographics. By developing a multimodal framework and employing statistical techniques

to fuse heterogeneous sets of features obtained through the processing of visual,

textual, and user interaction data, we significantly enhance the current state-of-the-art

approaches for identifying depressed individuals on Twitter (improving the average F1-

Score by 5 percent) as well as facilitate demographic inferences from social media. Besides

providing insights into the relationship between demographics and mental health, our

research assists in the design of a new breed of demographic-aware health interventions.

10aExplainable Machine Learning10aHypothesis Testing10aNational Language Processing10aPrediction10aRegression1 aYazdavar, Amir, Hossein1 aMahdavinejad, Mohammad, Saeid1 aBaja, Goonmeet1 aRomine, William1 aSheth, Amit1 aMonadjemi, Amir, Hassan1 aThirunarayan, Krishnaprasad1 aMeddar, John, M.1 aMyers, Annie1 aPathak, Jyotishman1 aHitzler, Pascal uhttps://journals.plos.org/plosone/article/file?id=10.1371/journal.pone.0226248&type=printable00643nas a2200169 4500008004100000245008300041210006900124260001200193653002500205653001900230653002400249653002000273100001800293700002000311700002300331856011900354 2017 eng d00a Propositional rule extraction from neural networks under background knowledge0 aPropositional rule extraction from neural networks under backgro c07/201710aBackground knowledge10aNeural Network10aPropositional Logic10aRule Extraction1 aLabaf, Maryam1 aHitzler, Pascal1 aEvans, Anthony, B. uhttps://daselab.cs.ksu.edu/publications/propositional-rule-extraction-neural-networks-under-background-knowledge-002037nas a2200229 4500008004100000245004200041210004200083300001400125490000600139520143400145653002401579653001501603653002201618653000801640653002001648653001701668653002601685100002101711700001201732700002001744856004301764 2013 eng d00aParaconsistent OWL and Related Logics0 aParaconsistent OWL and Related Logics a395–4270 v43 aThe Web Ontology Language OWL is currently the most prominent formalism for representing ontologies in Semantic Web applications. OWL is based on description logics, and automated reasoners are used to infer knowledge implicitly present in OWL ontologies. However, because typical description logics obey the classical principle of explosion, reasoning over inconsistent ontologies is impossible in OWL. This is so despite the fact that inconsistencies are bound to occur in many realistic cases, e.g., when multiple ontologies are merged or when ontologies are created by machine learning or data mining tools. In this paper, we present four-valued paraconsistent description logics which can reason over inconsistencies. We focus on logics corresponding to OWL DL and its profiles. We present the logic SROIQ4, showing that it is both sound relative to classical SROIQ and that its embedding into SROIQ is consequence preserving. We also examine paraconsistent varieties of EL++, DL-Lite, and Horn-DLs. The general framework described here has the distinct advantage of allowing classical reasoners to draw sound but nontrivial conclusions from even inconsistent knowledge bases. Truth-value gaps and gluts can also be selectively eliminated from models (by inserting additional axioms into knowledge bases). If gaps but not gluts are eliminated, additional classical conclusions can be drawn without affecting paraconsistency.10aAutomated Deduction10aComplexity10aDescription Logic10aOWL10aParaconsistency10aSemantic Web10aWeb Ontology Language1 aMaier, Frederick1 aMa, Yue1 aHitzler, Pascal uhttp://dx.doi.org/10.3233/SW-2012-006601470nas a2200205 4500008004100000245006600041210006600107300001400173490000700187520083300194653002001027653003301047653002901080653002801109653002901137100001801166700001601184700002001200856004401220 2013 eng d00aReasoning with Inconsistencies in Hybrid MKNF Knowledge Bases0 aReasoning with Inconsistencies in Hybrid MKNF Knowledge Bases a263–2900 v213 aThis paper is concerned with the handling of inconsistencies occurring in the combination of description logics and rules, especially in hybrid MKNF knowledge bases. More precisely, we present a paraconsistent semantics for hybrid MKNF knowledge bases (called para-MKNF knowledge bases) based on four-valued logic as proposed by Belnap. We also reduce this paraconsistent semantics to the stable model semantics via a linear transformation operator, which shows the relationship between the two semantics and indicates that the data complexity in our paradigm is not higher than that of classical reasoning. Moreover, we provide fixpoint operators to compute paraconsistent MKNF models, each suitable to different kinds of rules. At last we present the data complexity of instance checking in different paraMKNF knowledge bases.10aData complexity10aDescription logics and rules10aKnowledge representation10aNon-monotonic reasoning10aParaconsistent reasoning1 aHuang, Shasha1 aLi, Qingguo1 aHitzler, Pascal uhttp://dx.doi.org/10.1093/jigpal/jzs04301920nas a2200229 4500008004100000245007300041210006900114260002800183300001200211520122300223653002701446653001401473653002101487100001801508700002001526700001701546700001901563700001601582700002201598700002301620856004701643 2012 eng d00aMoving beyond SameAs with PLATO: Partonomy detection for Linked Data0 aMoving beyond SameAs with PLATO Partonomy detection for Linked D aMilwaukee, WI, USAbACM a33–423 a

The Linked Open Data (LOD) Cloud has gained significant traction over the past few years. With over 275 interlinked datasets across diverse domains such as life science, geography, politics, and more, the LOD Cloud has the potential to support a variety of applications ranging from open domain question answering to drug discovery.

Despite its significant size (approx. 30 billion triples), the data is relatively sparely interlinked (approx. 400 million links). A semantically richer LOD Cloud is needed to fully realize its potential. Data in the LOD Cloud are currently interlinked mainly via the owl:sameAs property, which is inadequate for many applications. Additional properties capturing relations based on causality or partonomy are needed to enable the answering of complex questions and to support applications.

In this paper, we present a solution to enrich the LOD Cloud by automatically detecting partonomic relationships, which are well-established, fundamental properties grounded in linguistics and philosophy. We empirically evaluate our solution across several domains, and show that our approach performs well on detecting partonomic properties between LOD Cloud data.

10aLinked Open Data Cloud10aMereology10aPart of Relation1 aJain, Prateek1 aHitzler, Pascal1 aVerma, Kunal1 aYeh, Peter, Z.1 aSheth, Amit1 aMunson, Ethan, V.1 aStrohmaier, Markus uhttp://doi.acm.org/10.1145/2309996.231000402649nas a2200277 4500008004100000245009100041210006900132260003400201300001400235490000900249520174100258653003601999653001902035653003002054653003702084653002202121653002002143100002102163700002502184700002002209700001602229700003202245700001902277700002402296856005102320 2010 eng d00aProvenance Context Entity (PaCE): Scalable Provenance Tracking for Scientific RDF Data0 aProvenance Context Entity PaCE Scalable Provenance Tracking for  aHeidelberg, GermanybSpringer a461–4700 v61873 a

The Semantic Web Resource Description Framework (RDF) format is being used by a large number of scientific applications to store and disseminate their datasets. The provenance information, describing the source or lineage of the datasets, is playing an increasingly significant role in ensuring data quality, computing trust value of the datasets, and ranking query results. Current Semantic Web provenance tracking approaches using the RDF reification vocabulary suffer from a number of known issues, including lack of formal semantics, use of blank nodes, and application-dependent interpretation of reified RDF triples that hinders data sharing. In this paper, we introduce a new approach called Provenance Context Entity (PaCE) that uses the notion of provenance context to create provenance-aware RDF triples without the use of RDF reification or blank nodes. We also define the formal semantics of PaCE through a simple extension of the existing RDF(S) semantics that ensures compatibility of PaCE with existing Semantic Web tools and implementations. We have implemented the PaCE approach in the Biomedical Knowledge Repository (BKR) project at the US National Library of Medicine to support provenance tracking on RDF data extracted from multiple sources, including biomedical literature and the UMLS Metathesaurus. The evaluations demonstrate a minimum of 49% reduction in total number of provenancespecific RDF triples generated using the PaCE approach as compared to RDF reification. In addition, using the PACE approach improves the performance of complex provenance queries by three orders of magnitude and remains comparable to the RDF reification approach for simpler provenance queries. 

10aBiomedical knowledge repository10aContext theory10aProvenance context entity10aProvenance Management Framework.10aProvenir ontology10aRDF reification1 aSahoo, Satya, S.1 aBodenreider, Olivier1 aHitzler, Pascal1 aSheth, Amit1 aThirunarayan, Krishnaprasad1 aGertz, Michael1 aLudäscher, Bertram uhttp://dx.doi.org/10.1007/978-3-642-13818-8_32