Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Rupesh R. Mehta

dblp:56/4162 · DBLP profile ↗
← Back
6ranked-venue papers
1as first author
2since 2021 · last 2022
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Databases, data management, data science and information retrieval · 3 · 1 first-authorGraphics, computer vision, multimedia, augmented reality and games · 3 · 2 since 2021Artificial intelligence and machine learning · 2 · 1 since 2021Applied, interdisciplinary, general and emerging computing · 2 · 1 first-author

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Databases, data mining, and information retrieval
3 papers
Data mining · 34% Web and social media mining · 34% Information retrieval · 20%
Artificial intelligence
1 paper
Information extraction and text analysis · 100%

Topics — the 8 heaviest of 8, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Natural language and speech › Information extraction and text analysis
web information extraction
0.112011
Web-scale information extraction with vertex · ICDE 2011
Natural language and speech › Information extraction and text analysis › web information extraction
wrapper induction
0.112011
Web-scale information extraction with vertex · ICDE 2011
Data mining › clustering › document clustering
web page clustering
0.112010
The paths more taken: matching DOM trees to search logs for accurate webpage clustering · WWW 2010
Web and social media mining › web page analysis
web page segmentation
0.112008
Web page sectioning using regex-based template · WWW 2008
Data integration and cleaning › data extraction
structured data extraction
0.012011
Web-scale information extraction with vertex · ICDE 2011
Information retrieval
search engines
0.012010
The paths more taken: matching DOM trees to search logs for accurate webpage clustering · WWW 2010
Information retrieval › user behavior
search logs
0.012010
The paths more taken: matching DOM trees to search logs for accurate webpage clustering · WWW 2010
Web and social media mining
web page analysis
0.012008
Web page sectioning using regex-based template · WWW 2008

Methods — techniques the papers use, named apart from their topics

wrapper induction · 0.2XPath rule learning · 0.2unsupervised clustering · 0.1DOM tree distance · 0.1regular expressions · 0.1
YearPublicationVenuePosition
2022 Streaming Bilingual End-to-End ASR Model Using Attention Over Multiple Softmax
abstract
Even with several advancements in multilingual modeling, it is challenging to recognize multiple languages using a single neural model, without knowing the input language and most multilingual models assume the availability of the input language. In this work, we propose a novel bilingual end-to-end (E2E) modeling approach, where a single neural model can recognize both languages and also support switching between the languages, without any language input from the user. The proposed model has shared encoder and prediction networks, with language-specific joint networks that are combined via a self-attention mechanism. As the language-specific posteriors are combined, it produces a single posterior probability over all the output symbols, enabling a single beam search decoding and also allowing dynamic switching between the languages. The proposed approach outperforms the conventional bilingual baseline with 13.3%, 8.23% and 1.3% word error rate relative reduction on Hindi, English and code-mixed test sets, respectively.
Aditya Patil, Vikas Joshi, Purvi Agrawal, Rupesh R. Mehta
SLT4
2021 Multiple Softmax Architecture for Streaming Multilingual End-to-End ASR Systems
Vikas Joshi, Amit Das 0007, Eric Sun, Rupesh R. Mehta, Jinyu Li 0001, Yifan Gong 0001
Interspeech4
2020 Transfer Learning Approaches for Streaming End-to-End Speech Recognition System
abstract
Transfer learning (TL) is widely used in conventional hybrid automatic speech recognition (ASR) system, to transfer the knowledge from source to target language. TL can be applied to end-to-end (E2E) ASR system such as recurrent neural network transducer (RNN-T) models, by initializing the encoder and/or prediction network of the target language with the pre-trained models from source language. In the hybrid ASR system, transfer learning is typically done by initializing the target language acoustic model (AM) with source language AM. Several transfer learning strategies exist in the case of the RNN-T framework, depending upon the choice of the initialization model for encoder and prediction networks. This paper presents a comparative study of four different TL methods for RNN-T framework. We show ~10%-17% relative word error rate reduction with different TL methods over randomly initialized RNN-T model. We also study the impact of TL with varying amount of training data ranging from 50 hours to 1000 hours and show the efficacy of TL for languages with a very small amount of training data.
Vikas Joshi, Rui Zhao 0017, Rupesh R. Mehta, Kshitiz Kumar, Jinyu Li 0001
INTERSPEECH3
2011 Web-scale information extraction with vertex
abstract
Vertex is a Wrapper Induction system developed at Yahoo! for extracting structured records from template-based Web pages. To operate at Web scale, Vertex employs a host of novel algorithms for (1) Grouping similar structured pages in a Web site, (2) Picking the appropriate sample pages for wrapper inference, (3) Learning XPath-based extraction rules that are robust to variations in site structure, (4) Detecting site changes by monitoring sample pages, and (5) Optimizing editorial costs by reusing rules, etc. The system is deployed in production and currently extracts more than 250 million records from more than 200 Web sites. To the best of our knowledge, Vertex is the first system to do high-precision information extraction at Web scale.
Pankaj Gulhane, Amit Madaan, Rupesh R. Mehta, Jeyashankher Ramamirtham, Rajeev Rastogi, Sandeepkumar Satpal, Srinivasan H. Sengamedu, Ashwin Tengli, Charu Tiwari
ICDE3
2010 The paths more taken: matching DOM trees to search logs for accurate webpage clustering
abstract
An unsupervised clustering of the webpages on a website is a primary requirement for most wrapper induction and automated data extraction methods. Since page content can vary drastically across pages of one cluster (e.g., all product pages on amazon.com), traditional clustering methods typically use some distance function between the DOM trees representing a pair of webpages. However, without knowing which portions of the DOM tree are "important," such distance functions might discriminate between similar pages based on trivial features (e.g., differing number of reviews on two product pages), or club together distinct types of pages based on superficial features present in the DOM trees of both (e.g., matching footer/copyright), leading to poor clustering performance.
Deepayan Chakrabarti, Rupesh R. Mehta
WWW2
2008 Web page sectioning using regex-based template
abstract
This work aims to provide a novel, site-specific web page segmentation and section importance detection algorithm, which leverages structural, content, and visual information. The structural and content information is leveraged via template, a generalized regular expression learnt over set of pages. The template along with visual information results into high sectioning accuracy. The experimental results demonstrate the effectiveness of the approach.
Rupesh R. Mehta, Amit Madaan
WWW1