Evidence map›Paper›PMID 30026812›Full record

ArticleBioData mining2018

Soft document clustering using a novel graph covering approach.

Jens Dörpinghaus, Sebastian Schaaf, Marc Jacobs

Abstract read
In one paragraph

Article in BioData mining, 2018. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Not yet cited in PubMed.

0numbers the graph read from it
0cells of the map it votes in
0citing 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

0 citing papers in PubMed.

No citing paper in PubMed yet.

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.

Jens DörpinghausFraunhofer Institute for Algorithms and Scientific Computing, Sankt Augustin, Schloss Birlinghoven, Sankt Augustin, Germany.ORCID 0000-0003-0245-7752
Sebastian SchaafFraunhofer Institute for Algorithms and Scientific Computing, Sankt Augustin, Schloss Birlinghoven, Sankt Augustin, Germany.
Marc JacobsFraunhofer Institute for Algorithms and Scientific Computing, Sankt Augustin, Schloss Birlinghoven, Sankt Augustin, Germany.

Funding

No grant is acknowledged in the PubMed record.

6 · The paper itself

Abstract

backgroundIn text mining, document clustering describes the efforts to assign unstructured documents to clusters, which in turn usually refer to topics. Clustering is widely used in science for data retrieval and organisation.

resultsIn this paper we present and discuss a novel graph-theoretical approach for document clustering and its application on a real-world data set. We will show that the well-known graph partition to stable sets or cliques can be generalized to pseudostable sets or pseudocliques. This allows to perform a soft clustering as well as a hard clustering. The software is freely available on GitHub.

conclusionsThe presented integer linear programming as well as the greedy approach for this

Indexed as

Document clusteringGraph theoryInformation retrieval

Identifiers

PMID30026812
PMCPMC6047369

What OpenQuestion holds

Textmetadata
LicenceCC BY
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.