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.
online collection and online analysis of Youtube videos together. Particularly, we focus on the statistics of user-specified keyword-indexed Youtube videos. Our system permits any user to capture user-interested videos and give online statistic with graphic views directly. One can also download the online statistic results
We develop and analyze an unsupervised and domain-independent method for extracting keywords from single documents. Our approach differs from the previous ones in the way of identifying candidate keywords, pruning the list of candidate keywords with several filtering heuristics and selecting keywords from the list of
In this paper, we propose a neural network based distance metric learning method for a better discrimination in the sequence-matching based keyword search (KWS). In this technique, we conduct a version of Dynamic Time Warping (DTW) based similarity search on the speaker independent posteriorgram space. With this, we
The H-KWS 2016, organized in the context of the ICFHR 2016 conference aims at setting up an evaluation framework for benchmarking handwritten keyword spotting (KWS) examining both the Query by Example (QbE) and the Query by String (QbS) approaches. Both KWS approaches were hosted into two different tracks, which in
This paper presents a new way for keyword spotting in degraded imaged document. Two prevalent word indexing, OCR and word shape coding, are combined compactly based on the recognition confidence evaluation. The basic procedures are as follows. First, OCR candidates are used for OCR indexing. Second, a new stoke
With the completion of the IARPA Babel program, it is possible to systematically analyze the performance of speech recognition systems across a wide variety of languages. We select 16 languages from the dataset and compare performance using a deep neural network-based acoustic model. The focus is on keyword spotting
Ranking solutions is an important issue in Information Retrieval because it greatly influences the quality of results. In this context, keyword based search approaches use to consider solutions sorting as least step of the overall process. Ranking and building solutions are completely separate steps running
This paper presents automatic pronunciation transliteration method with acoustic and contextual analysis for Chinese-English mixed language keyword spotting (KWS) system. More often, we need to develop robust Chinese-English mixed language spoken language technology without Chinese accented English acoustic data. In
a null score to any keyword that was not part of the training data, i.e. Out-of-Vocabulary (OOV) keywords, whereas other techniques are able to estimate a reasonable score even for these kind of keywords. We present a smoothing technique which estimates the score of an OOV keyword based on the scores of similar
This paper presents an objective keyword selection method called visualness with Lesk disambiguation (VLD) for describing educational videos with semantic tags. It extends the work on automatically extracting and associating meaningful keywords carried out in ‘semantic tags for lecture videos’ for
Keyword extraction aims to find representative phrases for a document. Graph-based keyword extraction represent the input document as a graph and rank its nodes according to their score using graph-based ranking method. In this paper, we propose a method to compute importance of co-occurrence word in document and
social media. Discovering keyword-based correlated networks of these large graphs is an important primitive in data analysis, from which users can pay more attention about their concerned information in the large graph. In this paper, we propose and define the problem of keyword-based correlated network computation over a
Recommender systems have been widely deployed on E-commerce websites. The cold start problem of making effective recommendations to new users without any historical data on the website is still challenging. These new users often have some available information, such as search keywords, before visiting the website. It
The use of Search Engine enables the information seeker to seek information from a wide range of categories. Cultural information is one of the unique categories among the classes of information searched by users. This is because, there exists a significant relationship between a cultural keyword and its' originating
Web-scale image search engines (e.g., Google image search, Bing image search) mostly rely on surrounding text features. It is difficult for them to interpret users' search intention only by query keywords and this leads to ambiguous and noisy search results which are far from satisfactory. It is important to use
solution helps in reducing the time to write documents by 42% as compared to the traditional methods of writing documents. Sophisticated statistical algorithms along with natural language processing technology are used to continuously determine the keywords and concepts from the content in the document. A web search is
Search engine is one of the mostly-used big data applications. However, search system varies in different platforms and fields, and there are few approaches to evaluate its quality. Search engine for online shopping systems combines text search and classification-based retrieval. It is more difficult to validate and evaluate quality since there are no definite quality standards or testing methods...
We study a new type of spatial-textual trajectory search: the Exemplar Trajectory Query (ETQ), which specifies one or more places to visit, and descriptions of activities at each place. Our goal is to efficiently find the top-k trajectories by computing spatial and textual similarity at each point. The computational cost for pointwise matching is significantly higher than previous approaches. Therefore,...
Real databases often consist of hundreds of innerlinked tables, which makes posing a complex join query a really hard task for common users. Join query recommendation is an effective technique to help users formulate better join queries and explore their information demand. In this paper, we propose a novel approach to automatically create join query recommendations based on path frequency. Our approach...
A method for locating mathematical expressions in document images without the use of optical character recognition is presented. An index of document regions is produced from recursive X-Y trees produced for each page in the corpus. Queries are provided as images of handwritten expressions, for which an X-Y tree is computed. During retrieval, the query is looked up in the document region index using...
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.