EDBT 2026 Demo / reviewers in the wild / expert
Mainak Mazumdar
dblp:07/6134
· DBLP profile ↗
4ranked-venue papers
1as first author
1since 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 · 2 · 1 first-author · 1 since 2021Artificial intelligence and machine learning · 1 · 1 first-authorSoftware engineering, systems software and programming languages · 1Applied, interdisciplinary, general and emerging computing · 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
2 papers |
Data mining · 46% Web and social media mining · 36% Data integration and cleaning · 18% | |
| Software engineering, system software, and programming languages
1 paper |
Software testing · 100% | |
| Interdisciplinary, comprehensive, and emerging computing
1 paper |
Computational social science and digital humanities · 100% |
Topics — the 8 heaviest of 9, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Data mining › structured data mining
graph mining |
0.6 | 1 | 2022 | Modeling Signed Networks as 2-Layer Growing Networks · IEEE Trans. Knowl. Data Eng. 2022 |
Web and social media mining › social network analysis
structural balance theory |
0.6 | 1 | 2022 | Modeling Signed Networks as 2-Layer Growing Networks · IEEE Trans. Knowl. Data Eng. 2022 |
Data integration and cleaning
data quality |
0.3 | 1 | 2017 | Addressing Challenges with Big Data for Media Measurement · KDD 2017 |
Data mining › structured data mining › graph mining
network reconstruction |
0.2 | 1 | 2022 | Modeling Signed Networks as 2-Layer Growing Networks · IEEE Trans. Knowl. Data Eng. 2022 |
Software testing › system testing
operational testing |
0.0 | 1 | 2002 | Modular Operational Test Plans for Inferences on Software Reliability Based on a Markov Model · IEEE Trans. Software Eng. 2002 |
Software testing › software reliability
reliability estimation |
0.0 | 1 | 2002 | Modular Operational Test Plans for Inferences on Software Reliability Based on a Markov Model · IEEE Trans. Software Eng. 2002 |
Software testing
software reliability |
0.0 | 1 | 2002 | Modular Operational Test Plans for Inferences on Software Reliability Based on a Markov Model · IEEE Trans. Software Eng. 2002 |
Mathematical optimization
discrete optimization |
0.0 | 1 | 2002 | Modular Operational Test Plans for Inferences on Software Reliability Based on a Markov Model · IEEE Trans. Software Eng. 2002 |
Methods — techniques the papers use, named apart from their topics
spectral analysis · 0.6set-top box data · 0.6preferential attachment · 0.6panel data · 0.6ground truth data · 0.6two-stage mathematical programming · 0.1markov model · 0.1
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2022 | Modeling Signed Networks as 2-Layer Growing NetworksabstractWe propose modeling signed networks by considering two layers in a social network for generation of positive and negative links where both the layers comprise of identical set of nodes. The growth process is modeled based on preferential attachment, formation of links probabilistically asserting structural balance of local groups, and internal growth which happens without addition of new nodes. We prove that the degree distribution of a generated network follows a power-law whose exponent depends on the largest eigenvalue of a matrix which governs the dynamics of growth of degrees of nodes with respect to positive and negative links. A computable formula for average degree and lower-bounds for the number of balanced and unbalanced triads of modelled networks are also obtained. A method for structural reconstruction of real signed networks is formulated through estimation the values of the model parameters to generate the network that can inherit different structural properties of the corresponding real network. Experimental results show that our model which we term as 2L-SNM can replicate properties of several real world signed networks much more robustly than competitive state-of-the-art techniques. Pradumn Kumar Pandey, Bibhas Adhikari, Mainak Mazumdar, Niloy Ganguly |
IEEE Trans. Knowl. Data Eng. | 3 |
| 2017 | Addressing Challenges with Big Data for Media MeasurementabstractThe digital media and TV - which is increasingly digitized, have amassed and generating enormous amount of data. While extremely useful, the big data generated by these platforms poses unique challenges for Data Scientists working on developing measurement framework and metrics. Most practitioners optimize speed and scale at the expense of accuracy, which is critical for any measurement. And, the trade-off between bias and variance is not in consideration. In this paper, we will demonstrate how Nielsen is combining proprietary ground truth data and methodologies with Big Data to address the accuracy and bias/variance challenges. We argue that high quality ground truth or training set is pre-requisite to deploying Big Data for high quality media measurement. To illustrate the point, we will share how Nielsen is combining its proprietary high quality panels with Set Top Box for TV measurement in the U.S. Mainak Mazumdar |
KDD | 1 |
| 2002 | Modular Operational Test Plans for Inferences on Software Reliability Based on a Markov ModelabstractThis paper considers the problem of assessing the reliability of a software system that can be decomposed into a finite number of modules. It uses a Markovian model for the transfer of control between modules in order to develop the system reliability expression in terms of the module reliabilities. An operational test procedure is considered in which only the individual modules are tested and the system is considered acceptable if, and only if, no failures are observed. The minimum number of tests required of each module is determined such that the probability of accepting a system whose reliability falls below a specified value R/sub 0/ is less than a specified small fraction /spl beta/. This sample size determination problem is formulated as a two-stage mathematical program and an algorithm is developed for solving this problem. Two examples from the literature are considered to demonstrate the procedure. Jayant Rajgopal, Mainak Mazumdar |
IEEE Trans. Software Eng. | 2 |
| 1996 | A system-based component test plan for a series system, with type-II censoringabstractAcceptance testing is analyzed for a series system of n components, each having an unknown, different, constant failure rate. Components are tested individually, and tests are terminated when a preassigned number of failures is observed for each component. The total time-on-test for each component is noted, and a statistic is constructed using observed test times and the number of failures of the components; the statistic is based on the maximum likelihood estimation of system reliability. This statistic is then used in specifying a decision rule for accepting or rejecting the entire system. The design of the test plan is stated as an optimization problem which minimizes test costs while ensuring that specified consumer and producer risks on system reliability are not exceeded. Numerical examples are provided, and implications of the test plan are discussed. Jayant Rajgopal, Mainak Mazumdar |
IEEE Trans. Reliab. | 2 |