ArticleDiscrete applied mathematics (Amsterdam, Netherlands : 1988)2016
Lower Bounds on Paraclique Density.
Article in Discrete applied mathematics (Amsterdam, Netherlands : 1988), 2016. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Cited by 11 papers.
What it found
Each row is one number read from the abstract, on the scale the paper reported it, with its interval. Left of the dashed line favours the treatment, right favours the comparator. Under each row is the sentence it came from. New to these charts? A ten-minute tutorial.
The abstract states no effect estimate the extractor could read, or names no intervention and outcome on the map, so this paper lights no cell and moves no belief. It is still indexed, cited and linked below.
The trial behind it
Trials whose registry record cites this paper, or whose number appears in the abstract. A trial that started after this paper was published is citing it as background, not reporting it.
Neither the registry nor the abstract names a trial number. If this is a trial report, that itself is worth knowing.
Who cites it
11 citing papers in PubMed.
- A Comparative Study of Gene Co-Expression Thresholding Algorithms.Journal of computational biology : a journal of computational molecular cell biology · 2024Article
- Seminar: Scalable Preprocessing Tools for Exposomic Data Analysis.Environmental health perspectives · 2023Article
- The public health exposome and pregnancy-related mortality in the United States: a high-dimensional computational analysis.BMC public health · 2022Article
- Molecular Subtyping and Outlier Detection in Human Disease Using the Paraclique Algorithm.Algorithms · 2021Article
- Unsupervised dimensionality reduction for exposome research.Current opinion in environmental science & health · 2020Article
- A robustness metric for biological data clustering algorithms.BMC bioinformatics · 2019Article
- Graph Theoretical Analysis of Genome-Scale Data: Examination of Gene Activation Occurring in the Setting of Community-Acquired Pneumonia.Shock (Augusta, Ga.) · 2018Article
- Robust Inference of Genetic Exchange Communities from Microbial Genomes Using TF-IDF.Frontiers in microbiology · 2017Article
- A novel approach to analyzing lung cancer mortality disparities: Using the exposome and a graph-theoretical toolchain.Environmental diseaseArticle
- Link Prediction in Multipartite Graphs With Application to Drug Repositioning Studies.IEEE transactions on computational biology and bioinformaticsArticle
- A multifactorial obesity model developed from nationwide public health exposome data and modern computational analyses.Obesity research & clinical practiceArticle
Corrections and comments
PubMed lists nothing against this paper. Absence here is not a guarantee, only a check that was made.
Authors and funding
3 authors.
Funding
Abstract
The scientific literature teems with clique-centric clustering strategies. In this paper we analyze one such method, the paraclique algorithm. Paraclique has found practical utility in a variety of application domains, and has been successfully employed to reduce the effects of noise. Nevertheless, its formal analysis and worst-case guarantees have remained elusive. We address this issue by deriving a series of lower bounds on paraclique densities.
Indexed as
Identifiers
What OpenQuestion holds
Registered trials
Read under generation 80e0d062 · epoch 390. Bibliography from PubMed, PubMed Central and OpenAlex; grants from NIH RePORTER; trial links from ClinicalTrials.gov; estimates, votes and beliefs from the OpenQuestion graph.