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.
be random and irrelevant. Our experimental results show that the keyword-specific LM outperforms the one trained on the raw web corpus, while expanding the size of the web-based data corpus no longer improve the EER point of the KWS system, but improve the performance on both end of the DET (Detection Error Tradeoff
Given a set of keywords, we find a maximum Web query (containing the most keywords possible) that respects user-defined bounds on the number of returned hits. We assume a real-world setting where the user is not given direct access to a Web search engine's index, i.e., querying is possible only through an interface
With the growing popularity of XML and emergence of streaming data model, processing streaming XML has become an important topic. This paper proposes keyword search solution over XML fragment streams based on hole-filler model. Two efficient indexes, dual list and sketch are developed to further improve the
Keyword Search is an emerging field for searching in database. It is an alternate way of dealing with traditional SQL querying in relational database with larger datasets. Now what happen in traditional databases is one need to know the attributes and the schema of databases. For the end-user to retrieve the data is
distributed hash tables (DHTs) - a peer-to-peer inspired overlay network technology - as the infrastructure to implement keyword search over relational databases. For this end, we combine IR-based ranking techniques with a P2P-based indexing strategy, and propose an effective approach. Extensive experiments over real-world
It is widely realized that the integration of information retrieval (IR) and database (DB) techniques provides users with a broad range of high quality services. A new challenging issue along the same direction is IR-styled m-keyword query processing in a RDBMS framework over an open-ended relational data stream. The
explicitly specify return information, our system will automatically analyze and choose appropriate return nodes by inferring from user keywords. Second, to return a meaningful result, we investigate the problem of the return information in the LCA and the proximity search approaches. To this end, we introduce the Lowest
derived from the links of documents, to help keyword-based search provide more accurate search results. However, unlike the Web documents, if the links between documents do not exist, it is difficult to exploit the authority for ranking documents. In this paper, our goals are to derive the implicit authority of documents
needs. In this paper, we present the design, architecture and implementation of an open-source keyword-based paradigm for the search of software resources in Grid infrastructures, called Minersoft. A key goal of Minersoft is to annotate automatically all the software resources with keyword-rich metadata. Using advanced
The goal of this paper is to cross-lingually analyze multilingual blogs collected with a topic keyword. The framework of collecting multilingual blogs with a topic keyword is designed as the blog feed retrieval procedure. Multilingual queries for retrieving blog feeds are created from Wikipedia entries. Finally, we
Many online or local data sources provide powerful querying mechanisms but limited ranking capabilities. For instance, PubMed allows users to submit highly expressive Boolean keyword queries, but ranks the query results by date only. However, a user would typically prefer a ranking by relevance, measured by an
multilingual information where backend will be English database and front-end uses local languages like Hindi, Marathi or Gujrathi. Our system provides an interface to enter a keyword in local language, the keyword will be parsed, query will be formed and display the result in local language. We had developed an efficient
when the sentence is analyzed. The goal is to put each noun and verb of the sentence on the right place on the tree. Taking this information into account, it is possible to solve the ambiguity problem for the query keywords and create the indicative summaries taking into account query words, and semantically related
Traditional legacy HTML based web sites/ page can be thought of as web services because the dynamic web pages can take user input argument via web forms and response to user query. The ability of agents and services to automatically locate and interact with unknown partners is a goal for Web based Data Integration
In this paper, we propose novel techniques to reduce bandwidth cost in a continuous keyword query processing system that is based on a distributed hash table. We argue that query indexing and document announcement are of significant importance towards this goal. Our detailed simulations show that our proposed
FCA, a session interest concept is defined as a pair of extent and intent where the extent covers a set of documents selected by the user among the search results and the intent covers a set of keyword features extracted from the selected documents. And, in order to make a concept network grow, we need to calculate the
In the World-Wide Web context, availability of software components increases the possibility of applying a reuse approach in software development. Thus, component retrieval is a key problem, both for software industry and for end-users. Several problems should be solved: components formalisms are very different from
This paper advocates for the need to build a Microblogs Data Management System (MDMS) as an end-to-end data management system to support indexing, querying, and analyzing microblogs, e.g., Tweets, comments, or check-in's. We identify a set of characteristics for microblogging environments that are distinguishing from
Mobile web browsing signifies accessing the content on web pages using a mobile device. It is common for Internet search engines to use keyword searching in which rank is assigned to each page based on several features. But it is an arduous task for a user to inscribe a keyword in such a delicate small mobile screen
In this paper, we put forward a technique for optimization of the search results obtained in response to an end user’s query. With the enormous volume of data present on the web, it is relatively easy to find matched documents containing the given query terms. The difficult part is to select the best from the
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.