Evidence map›Paper›PMID 27668263›Full record

ArticleInternational Conference on Computing, Networking, and Communications : [proceedings]. International Conference on Computing, Networking and Communications2016

ESammon: A Computationaly Enhanced Sammon Mapping based on Data Density.

Chanpaul Jin Wang, Hua Fang, Honggang Wang

Abstract read
In one paragraph

Article in International Conference on Computing, Networking, and Communications : [proceedings]. International Conference on Computing, Networking and Communications, 2016. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Cited by 1 paper.

0numbers the graph read from it
0cells of the map it votes in
1citing papers in PubMed
–field-weighted citation impact
1 · What the graph read from it

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.

2 · The registry

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.

3 · Its place in the literature

Who cites it

1 citing paper in PubMed.

  1. Article
4 · The record

Corrections and comments

PubMed lists nothing against this paper. Absence here is not a guarantee, only a check that was made.

5 · Who and what money

Authors and funding

3 authors.

Chanpaul Jin WangDepartment of Quantitative Health Science, University of Massachusetts Medical School, Worcester, USA; Department of Electrical and Computer Engineering, University of Massachusetts Dartmouth, North Dartmouth, MA, USA.
Hua FangDepartment of Quantitative Health Science, University of Massachusetts Medical School, Worcester, USA.
Honggang WangDepartment of Electrical and Computer Engineering, University of Massachusetts Dartmouth, North Dartmouth, MA, USA.

Funding

UNIVERSITY OF MASSACHUSETTS CENTER FOR CLINICAL AND TRANSLATIONAL SCIENCEUL1RR031982 · NCRR · UNIV OF MASSACHUSETTS MED SCH WORCESTER · PI SULLIVAN, JOHN LEWIS · 2010 to 2011
$6.8M
DISC: Describe Smoking Cessation in RCT Multi-Component Behavioral InterventionR01DA033323 · NIDA · UNIV OF MASSACHUSETTS MED SCH WORCESTER · PI FANG, HUA · 2013 to 2015
$701k
NCRR NIH HHS UL1 RR031982NIDA NIH HHS R01 DA033323
6 · The paper itself

Abstract

Sammon mapping is a widely used visualization technique to display complex data from high- to low-dimensional space. However, its extensive computational cost may pose potential computational challenges to big data visualization. This paper proposes a computationally-enhanced Sammon mapping (ESammon) by leveraging the characteristics of spatial data density. Unlike the conventional Sammon, ESammon preserves critical pairwise distances between data points in the process of projection, instead of all distances. Specifically, we integrated the Directed-Acyclic-Graph (DAG) based data density characterization method to select the critical distances. The numerical results demonstrated that our ESammon can achieve comparable projection results as the conventional Sammon mapping while reducing the computational cost from

Indexed as

data densityMultidimensional scaling (MDS)Sammon mapping

Identifiers

PMID27668263
PMCPMC5033056

What OpenQuestion holds

Textmetadata
LicenceTDM
Read underepoch 390

Registered trials

None linked

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.