Semantic Analytics of PubMed Content

Ślęzak, Dominik; Janusz, Andrzej; Świeboda, Wojciech; Nguyen, Hung Son; Bazan, Jan G.; Skowron, Andrzej

doi:10.1007/978-3-642-25364-5_7

Cited by 15 publications

(12 citation statements)

References 16 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Questions whether the approach presented inŚlęzak et al [22] is comparable with the type theory of Moschovakis algorithms extended in this paper, and if yes, how, remains open work. Studying the shared ideas and differences in these approaches may provide mutual enrichments and developments.…”

Section: Forthcoming and Future Workmentioning

confidence: 89%

Bindier Operators in Type-Theory of Algorithms for Algorithmic Binding of Functional Neuro-Receptors

Loukanova

2017

Annals of Computer Science and Information Systems

View full text Add to dashboard Cite

Abstract-This paper is on a new approach to mathematics of the notion of algorithm. We extend the higher-order, typetheory of acyclic recursion, i.e., of typed, state-dependent algorithms, which was originally introduced by Moschovakis in [1]. We introduce the concept of recursive λ-binding of argument slots across a sequence of mutually recursive assignments. The primary applications of the extended theory are to computational semantics of formal and natural languages, and to computational neuroscience. We investigate some properties of algorithmic equivalence of functions and relations that bind argument slots of other functions and relations across the recursion operator acting via mutually recursive assignments.

show abstract

Section: Forthcoming and Future Workmentioning

confidence: 89%

Bindier Operators in Type-Theory of Algorithms for Algorithmic Binding of Functional Neuro-Receptors

Loukanova

2017

Annals of Computer Science and Information Systems

View full text Add to dashboard Cite

show abstract

“…In the case of [12], it is even proposed that the system should be able to cover various domain models. e Handle structured, unstructured and heterogeneous data sources, mentioned by [15], [10], [16], [25], [26], [27]. This requirement is related to the diverse sources a semantic search needs to deal with.…”

Section: ) Rq2: Evaluation Methods For Validating And/or Verifying Tmentioning

confidence: 99%

“…• [15] [16], [17], [18], [19], [20], [21], [22], [23], [24], [25], [26], [27] for answering RQ3 only The following subsections present the most relevant data obtained from the selected studies. First, the general facts are analyzed, and then the research questions are answered.…”

Section: Secondary Searchmentioning

confidence: 99%

Research on Proposals and Trends in the Architectures of Semantic Search Engines: A Systematic Literature Review

Morales

Melgar

2017

Annals of Computer Science and Information Systems

View full text Add to dashboard Cite

Abstract-Semantic web technologies have gained some spotlight in recent years, mostly explained by the spread of mobile devices and broadband Internet access. As once envisioned by Tim Berners-Lee, semantic web technologies have fostered the development of standards that enable, in turn, the emergence of semantic search engines that give users the information they are looking for. This paper presents the results of a systematic literature review that focuses on understanding the proposals on the semantic search engines from an architectural point of view. From the results it is possible to say that most of the studies propose an integral solution for their users where their requirements, the context and the modules that comprise the search engine have a great role to play. Ontologies and knowledge also play an important role in these architectures as they evolve, enabling a great myriad of solutions that respond in a better way to the users' expectations.

show abstract

“…The scope of the first two modules may be categorized as a semantic data representation [4]. In opposite to the keyword search, the semantic data representation, and thus the semantic indexes, cannot be calculated once and then utilized by intelligent matching algorithms.…”

Section: Introductionmentioning

confidence: 99%

“…Within the SYNAT project, some successful methods for the semantic text representation and indexing have already been developed [4], [8]. In this paper we discuss an adaptive learning model of terms-to-concepts associations which can be treated as an extension of the Explicit Semantic Analysis (ESA) method [9], [10].…”

Section: Introductionmentioning

confidence: 99%

Adaptive Learning for Improving Semantic Tagging of Scientific Articles

Janusz

Stawicki

Nguyen

2014

Annals of Computer Science and Information Systems

Self Cite

View full text Add to dashboard Cite

Abstract-In this paper we consider a problem of automatic labeling of textual data with concepts explicitly defined in an external knowledge base. We describe our tagging system and we also present a framework for adaptive learning of associations between terms or phrases from the texts and the concepts. Those associations are then utilized by our semantic interpreter, which is based on the Explicit Semantic Analysis (ESA) method, in order to label scientific articles indexed by our SONCA platform. Apart from the description of the learning algorithm, we show a few practical application examples of our system, in which it was used for tagging scientific articles with headings from the MeSH ontology, categories from ACM Computing Classification System and from OECD Fields of Science and Technology Classification.

show abstract

Semantic Analytics of PubMed Content

Cited by 15 publications

References 16 publications

Bindier Operators in Type-Theory of Algorithms for Algorithmic Binding of Functional Neuro-Receptors

Bindier Operators in Type-Theory of Algorithms for Algorithmic Binding of Functional Neuro-Receptors

Research on Proposals and Trends in the Architectures of Semantic Search Engines: A Systematic Literature Review

Adaptive Learning for Improving Semantic Tagging of Scientific Articles

Contact Info

Product

Resources

About