Query Concepts Research Articles

Set Prediction Guided by Semantic Concepts for Diverse Video Captioning

Diverse video captioning aims to generate a set of sentences to describe the given video in various aspects. Mainstream methods are trained with independent pairs of a video and a caption from its ground-truth set without exploiting the intra-set relationship, resulting in low diversity of generated captions. Different from them, we formulate diverse captioning into a semantic-concept-guided set prediction (SCG-SP) problem by fitting the predicted caption set to the ground-truth set, where the set-level relationship is fully captured. Specifically, our set prediction consists of two synergistic tasks, i.e., caption generation and an auxiliary task of concept combination prediction providing extra semantic supervision. Each caption in the set is attached to a concept combination indicating the primary semantic content of the caption and facilitating element alignment in set prediction. Furthermore, we apply a diversity regularization term on concepts to encourage the model to generate semantically diverse captions with various concept combinations. These two tasks share multiple semantics-specific encodings as input, which are obtained by iterative interaction between visual features and conceptual queries. The correspondence between the generated captions and specific concept combinations further guarantees the interpretability of our model. Extensive experiments on benchmark datasets show that the proposed SCG-SP achieves state-of-the-art (SOTA) performance under both relevance and diversity metrics.

Query-driven Qualitative Constraint Acquisition

Many planning, scheduling or multi-dimensional packing problems involve the design of subtle logical combinations of temporal or spatial constraints. Recently, we introduced GEQCA-I, which stands for Generic Qualitative Constraint Acquisition, as a new active constraint acquisition method for learning qualitative constraints using qualitative queries. In this paper, we revise and extend GEQCA-I to GEQCA-II with a new type of query, universal query, for qualitative constraint acquisition, with a deeper query-driven acquisition algorithm. Our extended experimental evaluation shows the efficiency and usefulness of the concept of universal query in learning randomly-generated qualitative networks, including both temporal networks based on Allen’s algebra and spatial networks based on region connection calculus. We also show the effectiveness of GEQCA-II in learning the qualitative part of real scheduling problems.

Combining offline and on-the-fly disambiguation to perform semantic-aware XML querying

Many efforts have been deployed by the IR community to extend freetext query processing toward semi-structured XML search. Most methods rely on the concept of Lowest Comment Ancestor (LCA) between two or multiple structural nodes to identify the most specific XML elements containing query keywords posted by the user. Yet, few of the existing approaches consider XML semantics, and the methods that process semantics generally rely on computationally expensive word sense disambiguation (WSD) techniques, or apply semantic analysis in one stage only: performing query relaxation/refinement over the bag of words retrieval model, to reduce processing time. In this paper, we describe a new approach for XML keyword search aiming to solve the limitations mentioned above. Our solution first transforms the XML document collection (offline) and the keyword query (on-the-fly) into meaningful semantic representations using context-based and global disambiguation methods, specially designed to allow almost linear computation efficiency. We use a semantic-aware inverted index to allow semantic-aware search, result selection, and result ranking functionality. The semantically augmented XML data tree is processed for structural node clustering, based on semantic query concepts (i.e., key-concepts), in order to identify and rank candidate answer sub-trees containing related occurrences of query key-concepts. Dedicated weighting functions and various search algorithms have been developed for that purpose and will be presented here. Experimental results highlight the quality and potential of our approach.

Identical Image Extraction from PDF Document Using LBP (Local Binary Patterns) and RGB (Red, Green and Blue) Color Features

Abstract: Content based image retrieval (CBIR) has become a main research area in multimedia applications. In the literature, there is lot of papers focusing on the content-based image retrieval in order to extract the semantic information within the query concept. The content based image retrieval aims to find the similar images from PDF document against a query image. Generally, the similarity between the representative features of the query image and PDF images is used to rank the images for retrieval. In early days, various hand designed feature descriptors have been investigated based on the visual cues such as color, texture, shape, etc. that represent the images. In this project we have developed a method to extract the images present in PDF documents based on appropriate features extracted from query image such as color and local binary pattern features to find perfect matching image is present in PDF or not. Based on similarity analysis model we will display the query input image is present in PDF documents or not. If query matching image is present in the PDF documents then we will display the list corresponding PDF documents using suitable applications to show the presence.

Video as Conditional Graph Hierarchy for Multi-Granular Question Answering

Video question answering requires the models to understand and reason about both the complex video and language data to correctly derive the answers. Existing efforts have been focused on designing sophisticated cross-modal interactions to fuse the information from two modalities, while encoding the video and question holistically as frame and word sequences. Despite their success, these methods are essentially revolving around the sequential nature of video- and question-contents, providing little insight to the problem of question-answering and lacking interpretability as well. In this work, we argue that while video is presented in frame sequence, the visual elements (e.g., objects, actions, activities and events) are not sequential but rather hierarchical in semantic space. To align with the multi-granular essence of linguistic concepts in language queries, we propose to model video as a conditional graph hierarchy which weaves together visual facts of different granularity in a level-wise manner, with the guidance of corresponding textual cues. Despite the simplicity, our extensive experiments demonstrate the superiority of such conditional hierarchical graph architecture, with clear performance improvements over prior methods and also better generalization across different type of questions. Further analyses also demonstrate the model's reliability as it shows meaningful visual-textual evidences for the predicted answers.

A unified representation and transformation of multi-model data using category theory

The support for multi-model data has become a standard for most of the existing DBMSs. However, the step from a conceptual (e.g., ER or UML) schema to a logical multi-model schema of a particular DBMS is not straightforward. In this paper, we extend our previous proposal of multi-model data representation using category theory for transformations between models. We introduce a mapping between multi-model data and the categorical representation and algorithms for mutual transformations between them. We also show how the algorithms can be implemented using the idea of wrappers with the interface published but specific internal details concealed. Finally, we discuss the applicability of the approach to various data management tasks, such as conceptual querying.

Impact of Lifelong-Learning Mindset on Career Success of Professionals in the Field of Accounting

The notion that the lifelong-learning concept bolsters career success is one of the popular and debated research areas in the world. Within the Sri Lankan context, there is a lack of evidence to determine this concept and only have the impression that a lifelong-learning mindset positively impacts career success. Therefore, this conceptual query is carried out to warrant scholarly investigation that encapsulates the impact of a lifelong-learning mindset on the career success of accounting professionals in Sri Lanka. By bridging the lacuna in existing research studies and determining the relationship between lifelong mindset and career success in the Sri Lankan context, this study tries to fulfill the empirical gap and contribute new knowledge. The study was conducted in SLIIT Business School, SLIIT, Sri Lanka during the time period between February to October 2021.
 Adopting an online questionnaire survey strategy and convenience sampling method, primary data was collected from a sample of 384 respondents who are accounting professionals in the Western Province of Sri Lanka. Descriptive statistics, correlation analysis, and multiple linear regression analysis were used to analyze the data and interpret the findings.
 According to the findings, there is a significant impact on career success from a lifelong-learning mindset, and a positive relationship between lifelong-learning mindset and career success with a Pearson Correlation Coefficient of +.729. The study discovered that increasing the Lifelong-learning mindset attitude by one unit increases the career success of accounting professionals by 77.9 percent (P = 0.000). The research found that out of three factors, namely, learning curiosity, strategic thinking, and resilience; only curiosity and resilience have a statically significant impact on career success in Sri Lanka. A finding this research was able to identify is that strategic thinking does not significantly impact career success within the Sri Lankan context.

Taxonomy Completion via Triplet Matching Network

Automatically constructing taxonomy finds many applications in e-commerce and web search. One critical challenge is as data and business scope grow in real applications, new concepts are emerging and needed to be added to the existing taxonomy. Previous approaches focus on the taxonomy expansion, i.e. finding an appropriate hypernym concept from the taxonomy for a new query concept. In this paper, we formulate a new task, “taxonomy completion”, by discovering both the hypernym and hyponym concepts for a query. We propose Triplet Matching Network (TMN), to find the appropriate pairs for a given query concept. TMN consists of one primal scorer and multiple auxiliary scorers. These auxiliary scorers capture various fine-grained signals (e.g., query to hypernym or query to hyponym semantics), and the primal scorer makes a holistic prediction on triplet based on the internal feature representations of all auxiliary scorers. Also, an innovative channel-wise gating mechanism that retains task-specific information in concept representations is introduced to further boost model performance. Experiments on four real-world large-scale datasets show that TMN achieves the best performance on both taxonomy completion task and the previous taxonomy expansion task, outperforming existing methods.

HyRa: An Effective Hybrid Ranking Model

Information retrieval (IR) systems are concerned of the processing of the textual content of the document, the query, and issues of system effectiveness. IR models are means to integrate many sources of evidence on documents to achieve an effective retrieval system. Unlike traditional parameters such as word frequency in documents, semantic information retrieval is an environment that requires the application of semantic techniques. These techniques calculate a degree of query-document relevance to assign the highest rankings to the documents which are semantically closer to the query. To meet the user’s information needs and to optimize the performance of IR system, an innovative model was proposed to calculate the relevance of query-document pairs. The proposed model is a hybrid one that based on a query likelihood language model and a conceptual weighting model. It exploits the semantic similarity between document and query concepts and some document/collection statistics. The conducted experiments on the proposed model show improvement of the standard performance measures over the benchmark competitors. A statistical significance test is conducted to exclude the performance random variation of the compared models. Paired t-tests show that the proposed model is highly significant improves the most important measures.

Concept Based Intelligent Information Retrieval Within Digital Library

A digital library is a type of information retrieval (IR) system. The existing information retrieval methodologies generally have problems on keyword-searching. We proposed a model to solve the problem by using concept-based approach (ontology) and metadata case base. This model consists of identifying domain concepts in user’s query and applying expansion to them. The system aims at contributing to an improved relevance of results retrieved from digital libraries by proposing a conceptual query expansion for intelligent concept-based retrieval. We need to import the concept of ontology, making use of its advantage of abundant semantics and standard concept. Domain specific ontology can be used to improve information retrieval from traditional level based on keyword to the lay based on knowledge (or concept) and change the process of retrieval from traditional keyword matching to semantics matching. One approach is query expansion techniques using domain ontology and the other would be introducing a case based similarity measure for metadata information retrieval using Case Based Reasoning (CBR) approach. Results show improvements over classic method, query expansion using general purpose ontology and a number of other approaches.

Application of convolution neural network in web query session mining for personalised web search

In this paper, a deep learning convolution neural network (CNN) is applied in web query session mining for effective personalised web search. The CNN extracts high-level continuous clicked document/query concept vector for semantic clustering of documents. The CNN model is trained to generate document/query concept vector based on clickthrough web query session data. Training of CNN is done using backpropagation based on stochastic gradient descent maximising the likelihood of relevant document given a user search query. During web search, search query concept vector is generated and compared with semantic clusters means to select the most similar cluster for web document recommendations. The experimental results were analysed based on average precision of search results and loss function computed during training of CNN. The improvement in precision of search results as well as decrease in loss value proves CNN to be effective in capturing semantics of web user query sessions for effective information retrieval.

Finding influential communities in networks with multiple influence types

Recent studies on the influential community model have discovered communities that contain highly influential members. There are many types of metrics that describe the influences of objects in networks. Existing methods, however, search for influential communities based on only one influence type without comprehensively considering other influence types. In this paper, we propose an efficient influential community search method that finds the top-γ most influential communities across multiple influence criteria. The influences are modeled as multi-dimensional vectors, where each dimension represents an influence type. To rank communities properly, we utilize the top-γ dominating query concept for multi-dimensional point data. Extensive experiments demonstrate that the proposed method effectively finds influential communities based on multiple influence types and is orders of magnitude faster than a baseline solution.

Head Concepts Selection for Verbose Medical Queries Expansion

Semantic concepts and relations encoded in domain-specific ontologies and other medical semantic resources play a crucial role in deciphering terms in medical queries and documents. The exploitation of these resources for tackling the semantic gap issue has been widely studied in the literature. However, there are challenges that hinder their widespread use in real-world applications. Among these challenges is the insufficient knowledge individually encoded in existing medical ontologies, which is magnified when users express their information needs using long-winded natural language queries. In this context, many of the users query terms are either unrecognized by the used ontologies, or cause retrieving false positives that degrade the quality of current medical information search approaches. In this article, we explore the combination of multiple extrinsic semantic resources in the development of a full-fledged medical information search framework to: i) highlight and expand head medical concepts in verbose medical queries (i.e. concepts among query terms that significantly contribute to the informativeness and intent of a given query), ii) build semantically enhanced inverted index documents, iii) contribute to a heuristical weighting technique in the query document matching process. To demonstrate the effectiveness of the proposed approach, we conducted several experiments over the CLEF eHealth 2014 dataset. Findings indicate that the proposed method combining several extrinsic semantic resources proved to be more effective than related approaches in terms of precision measure.

Top-k User-Defined Vertex Scoring Queries in Edge-Labeled Graph Databases

We consider identifying highly ranked vertices in large graph databases such as social networks or the Semantic Web where there are edge labels. There are many applications where users express scoring queries against such databases that involve two elements: (i) a set of patterns describing relationships that a vertex of interest to the user must satisfy and (ii) a scoring mechanism in which the user may use properties of the vertex to assign a score to that vertex. We define the concept of a partial pattern map query (partial PM-query), which intuitively allows us to prune partial matchings, and show that finding an optimal partial PM-query is NP-hard. We then propose two algorithms, PScore_LP and PScore_NWST, to find the answer to a scoring (top- k ) query. In PScore_LP, the optimal partial PM-query is found using a list-oriented pruning method. PScore_NWST leverages node-weighted Steiner trees to quickly compute slightly sub-optimal solutions. We conduct detailed experiments comparing our algorithms with (i) an algorithm (PScore_Base) that computes all answers to the query, evaluates them according to the scoring method, and chooses the top- k , and (ii) two Semantic Web query processing systems (Jena and GraphDB). Our algorithms show better performance than PScore_Base and the Semantic Web query processing systems—moreover, PScore_NWST outperforms PScore_LP on large queries and on queries with a tree structure.

Coupled intrinsic and extrinsic human language resource-based query expansion

Poor information retrieval performance has often been attributed to the query-document vocabulary mismatch problem which is defined as the difficulty for human users to formulate precise natural language queries that are in line with the vocabulary of the documents deemed relevant to a specific search goal. To alleviate this problem, query expansion processes are applied in order to spawn and integrate additional terms to an initial query. This requires accurate identification of main query concepts to ensure the intended search goal is duly emphasized and relevant expansion concepts are extracted and included in the enriched query. Natural language queries have intrinsic linguistic properties such as parts-of-speech labels and grammatical relations which can be utilized in determining the intended search goal. Additionally, extrinsic language-based resources such as ontologies are needed to suggest expansion concepts semantically coherent with the query content. We present here a query expansion framework which capitalizes on both linguistic characteristics of user queries and ontology resources for query constituent encoding, expansion concept extraction and concept weighting. A thorough empirical evaluation on real-world datasets validates our approach against unigram language model, relevance model and a sequential dependence based technique.

Errors and Complications in SQL Query Formulation

SQL is taught in almost all university level database courses, yet SQL has received relatively little attention in educational research. In this study, we present a database management system independent categorization of SQL query errors that students make in an introductory database course. We base the categorization on previous literature, present a class of logical errors that has not been studied in detail, and review and complement these findings by analyzing over 33,000 SQL queries submitted by students. Our analysis verifies error findings presented in previous literature and reveals new types of errors, namely logical errors recurring in similar manners among different students. We present a listing of fundamental SQL query concepts we have identified and based our exercises on, a categorization of different errors and complications, and an operational model for designing SQL exercises.

Comparing and Contrasting Two ESSENCE Syndrome Definition Query Methods

Comparing and Contrasting Two ESSENCE Syndrome Definition Query Methods

Deep Learning and Semantic Concept Spaceare Used in Query Expansion

In the practice of information retrieval, there are some problems such as the lack of accurate expression of user query requests, the mismatch between document and query and query optimization. Focusing on these problems, we propose the query expansion method based on conceptual semantic space with deep learning, this hybrid query expansion technique include deep learning and pseudocorrelation feedback, use the deep learning and semantic network WordNet to construct query concept tree in the level of concept semantic space, the pseudo-correlation feedback documents are processed by observation window, compute the co-occurrence weight of the words by using the average mutual information and get the final extended words set. The results of experiment show that the expansion algorithm based on conceptual semantic space with deep learning has better performance than the traditional pseudo-correlation feedback algorithm on query expansion.

Ad hoc retrieval via entity linking and semantic similarity

Semantic search has emerged as a possible way for addressing the challenges of traditional keyword-based retrieval systems such as the vocabulary gap between the query and document spaces. In this paper, we propose a novel semantic retrieval framework that uses semantic entity linking systems for forming a graph representation of documents and queries, where nodes represent concepts extracted from documents and edges represent semantic relatedness between those concepts. The core of our proposed work is a semantic-enabled language model that estimates the probability of generating query concepts given values assigned to document concepts. The semantic retrieval framework also provides basis for interpolating keyword-based retrieval systems with the semantic-enabled language model. We conduct comprehensive experiments over several Trec document collections and analyze the performance of different configurations of the framework across multiple retrieval measures. Our experimental results show that the proposed semantic retrieval model has a synergistic impact on the results obtained through the state-of-the-art keyword-based systems, and the consideration of semantic information can complement and enhance the performance of such retrieval models.

Climate Similarity Search: GeoWeb Tool for Exploring Climate Variability

Abstract Climate and climate change are among the scientific topics most widely recognized by the public. Thus, climatologists seek out effective ways of communicating results of their research to various constituencies—a task made difficult by the complexity of the concept of climate. The current standard for communicated variability of climate on the global scale is a map based on the Köppen-Geiger classification (KGC) of climates, and maps of change in average annual temperatures and total annual precipitation for communicating climate change. The ClimateEx (Climate Explorer) project (http://sil.uc.edu/webapps/climateex/) communicates spatial variability and temporal change of global climate in a novel way by using the data science concept of similarity-based query. ClimateEx is implemented as a web-based visual spatial search tool. Users select a location (query), and ClimatEx returns a similarity map that visually communicates locations of places in the world having climates similar to the climate at a query location. ClimateEx can also inform about magnitude of temporal climate change by calculating a global map of local magnitudes of climate change. It offers personalized means of communicating climate heterogeneity and conveying magnitude of climate change in a single map. It has the advantage of relating climate to a user’s own experience, and is well-suited for communicating character of global climate to specialists and nonspecialists alike.