The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
In online social networks (OSNs), user connections can be represented as a network. The network formed has distinct properties that distinguish it from other network topologies. In this work, we consider an unstructured keyword based social network topology where each edge has a trust value associated with it to
solutions featuring multiple desired functionalities. In this paper, we present a solution that incorporates search, phrase search, auditing where resources are reused for enabling each functionality, achieving an overall smaller storage cost, complexity than implementing each of the functionalities separately. The solution
With the continued proliferation of location-based services, a growing number of web-accessible data objects are geotagged and have text descriptions. An important query over such web objects is the direction-aware spatial keyword query that aims to retrieve the top-k objects that best match query parameters in terms
Keyword search is a user-friendly way to query XML data, such that users do not need to understand the complex syntax of structured query languages and the complex structural information of the underlying XML data. However, existing semantics suffer from limited expressiveness, thus users cannot obtain desired
This paper presents our recent attempt to make a super-large scale spoken-term detection system, which can detect any keyword uttered in a 2,000-hour speech database within a few seconds. There are three problems to achieve such a system. The system must be able to detect out-of-vocabulary (OOV) terms (OOV problem
this paper we propose Privacy Preserving Synonym Based Fuzzy Multi-Keyword Ranked Search Over Encrypted Cloud Data, a scheme which enhances user search experience to a paramount by providing both fuzzy and synonym based multi-keyword ranked search, thereby taking encrypted search experience closer to free text search
keyword hypotheses from a syllable confusion network (SCN). SCN is linear and naturally suitable for indexing. To accelerate search process, SCN are pruned to feasible sizes. As a post-processing method, minimum classification error (MCE) optimized confidence measure is adopted to reject false accepts. On Mandarin
and their locations satisfied with the regional requirement. To do so, a 3-level hybrid index structure is introduced. This structure combines R*-tree and inverted lists with the q-grams of the keywords of the objects. R*-tree partitions the objects as well as regional q-grams, which are the qgrams of the keywords of the
. In this work, we present an efficient method to answer top-k spatial keyword queries. To do so, we introduce an indexing structure called IR2-Tree (Information Retrieval R-Tree) which combines an R-Tree with superimposed text signatures. We present algorithms that construct and maintain an IR2-Tree
This paper describes the application of agents to automate information exchange for digital preservation. Agents are able to recommend preservation solutions and also apply them to different preservation situations. Trust models for question-routing and answer ranking that are implemented by means of agents, show
Cloud computing enables a promising paradigm of data service outsourcing, where data owners can avoid committing large capital outlays by economically storing their data to public data centers for the convenient management of data storage and utilization. Despite the tremendous benefits, outsourcing data to the
This paper presents a spoken term detection method, based on automatic speech recognition and phonetic representation. The proposed method combines textual search in word transcripts obtained with a large vocabulary continuous speech recognizer system and phonetic search in the phonetization of these transcripts, to
such as children. It may be very intricate for children to search their desired content effectively using the traditional ‘keyword based’ search mechanism. They may fail to map the desired concept into appropriate keywords. To circumvent this situation, Faceted navigation is proposed as an effective
looking for and how to find it, i.e. to know the appropriate keywords to obtain the desired results But in many cases either the objectives of the searcher are intrinsically fuzzy or she has no idea of the appropriate keywords. Complex search tasks often cannot be answered by retrieving a single document, but require
Finding relevant documents in digital libraries has been a well studied problem in information retrieval. It is not uncommon to see users browsing digital collections without having a clear idea of the keyword search that they should perform. However, we believe that such initial query search is not totally
Search engines usually return relevant sorted results based on the keywords. Because of the lack of considering the user's current search interest and intention, this kind of strategy may not meet users' personalized search requirements. In order to retrieve results associated with the user's current search interest
In this paper, we propose the ldquoaddedrdquo use of proximity search to a Web search query for narrowing down the set of documents returned as answers to a keyword based search query. This approach adds value to Web search query results by allowing users to better express what they are looking for. Most of the
burden on searching over the graph data to find desired sub graphs. Faceted search is a promising approach to reduce the burden of searching graph data. Applying faceted search for graph data requires to determine objects (target sub graphs) and facets. To achieve this, in this paper, we propose a framework for faceted
could not provide effective clues to real innovation. The authors consider that the most perplexing problem during innovative thinking is to find the genuine problem of objective design; therefore, the proposed idea introducing a keyword recognition approach based on a specific keywordbank and its corresponding TRIZ
Consumer data, such as documents and photos, are increasingly being stored in the cloud. To ensure confidentiality, the data is encrypted before being outsourced. However, this makes it difficult to search the encrypted data directly. Recent approaches to enable searching of this encrypted data have relied on
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.