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

Shobhit Mathur

dblp:61/1337 · DBLP profile ↗
← Back
2ranked-venue papers
1as first author
1since 2021 · last 2021
0000-0002-2470-960XORCID · corroborated

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

Databases, data management, data science and information retrieval · 1

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
1 paper
Database theory · 44% Data integration and cleaning · 44% Query processing and optimization · 13%

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

TopicWeightPapersLastEvidence papers
Data integration and cleaning
data quality
0.112005
MYSTIQ: a system for finding more answers by using probabilities · SIGMOD Conference 2005
Database theory › probabilistic databases
probabilistic query semantics
0.112005
MYSTIQ: a system for finding more answers by using probabilities · SIGMOD Conference 2005

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

probabilistic query semantics · 0.1
YearPublicationVenuePosition
2021 Machine-Learning directed Article Detection on the Web using DOM and text-based features
abstract
Burgeoning trend of digital advertising have led websites to embody massive irrelevant content such as page navigation, ads, distractions, promotional videos etc‥. on their pages. In contrast to desktop, limited screen space of mobile carrying variety of ineffectual content magnifies the visual complexity of webpage by disrupting focus of user to read useful content. To solve this issue, Reader mode functionality renders a clutter-free version of web page by stripping out all insignificant elements and letting user to read the content they are actually interested in. Existing implementation in our browser involves 2 modules - Article Detection module that runs heuristics to detect whether a web page is article or not, proceeded by Article Extraction module that extracts the main content of the web page by removing all unwanted elements. Our paper focusses on improving the accuracy of article detection logic by proposing a machine-learning based solution that significantly surpasses the present heuristic-based model in terms of accuracy. In order to get rid of false positives on webpages with meaningless content like product descriptions, we extended our previous solution [1] by incorporating backward-elimination heuristics for web page title and extracting strong Boolean predictors. Our approach also solves the problem of detecting reader mode on Google's AMP HTML web pages where main-content is rendered in an iframe. With this model, we were able to achieve a precision of 0.99 and a recall of 0.94, which outperforms the state-of-the-art techniques which are being used by the major Android based web browsers in the market today.
Shobhit Mathur, Pritam Nikam, Harshita Patidar, Rohan Bapusaheb Gaikwad, Preeti Narayan Nayak
CCNC1
2005 MYSTIQ: a system for finding more answers by using probabilities
abstract
MystiQ is a system that uses probabilistic query semantics [3] to find answers in large numbers of data sources of less than perfect quality. There are many reasons why the data originating from many different sources may be of poor quality, and therefore difficult to query: the same data item may have different representation in different sources; the schema alignments needed by a query system are imperfect and noisy; different sources may contain contradictory information, and, in particular, their combined data may violate some global integrity constraints; fuzzy matches between objects from different sources may return false positives or negatives. Even in such environment, users some-times want to ask complex, structurally rich queries, using query constructs typically found in SQL queries: joins, subqueries, existential/universal quantifiers, aggregate and group-by queries: for example scientists may use such queries to query multiple scientific data sources, or a law enforcement agency may use it in order to find rare associations from multiple data sources. If standard query semantics were applied to such queries, all but the most trivial queries will return an empty answer.
Jihad Boulos, Nilesh N. Dalvi, Bhushan Mandhani, Shobhit Mathur, Christopher Ré, Dan Suciu
SIGMOD Conference4