Near-perfect Clustering Based on Recursive Binary Splitting Using Max-MMD.

Chakrabarty S, Chakraborty A, De SK

DOI: 10.1109/tpami.2026.3669975
Published: 2026 Sep
Container: IEEE transactions on pattern analysis and machine intelligence
Publisher: Not recorded
Open access: unknown

Credibility signals

limited evidence Score 43/100 under policy 1.0.0. This is a metadata assessment, not a judgment of the paper's conclusions.

Show all credibility signals

cautionDOI registered: No matching Crossref record was present in this response. Source: Crossref; license: CC0 metadata
cautionDOI resolves: No matching Crossref record was present in this response. Source: Crossref; license: CC0 metadata
not scoredDirectory of Open Access Journals: No matching DOAJ record was present in this response. No allow-list match; this is not evidence of low credibility. Source: DOAJ; license: CC0
not scoredMEDLINE indexed: Not checked or no result supplied; no credibility inference made. Source: No authority result supplied; license: Unknown
not scoredOpenAlex core source: Not checked or no result supplied; no credibility inference made. Source: No authority result supplied; license: Unknown
not scoredKnown publisher allow-list: Not checked or no result supplied; no credibility inference made. Source: No authority result supplied; license: Unknown
not scoredROR affiliation: Not checked or no result supplied; no credibility inference made. Source: No authority result supplied; license: Unknown
not scoredRetraction Watch retraction: No retraction notice matched this DOI in the deployed snapshot. No matching event found; coverage may be incomplete. Source: Retraction Watch; license: CC BY 4.0
not scoredRetraction Watch expression of concern: No expression of concern notice matched this DOI in the deployed snapshot. No matching event found; coverage may be incomplete. Source: Retraction Watch; license: CC BY 4.0
not scoredRetraction Watch correction: No correction notice matched this DOI in the deployed snapshot. No matching event found; coverage may be incomplete. Source: Retraction Watch; license: CC BY 4.0
not scoredRetraction Watch reinstatement: No reinstatement notice matched this DOI in the deployed snapshot. No matching event found; coverage may be incomplete. Source: Retraction Watch; license: CC BY 4.0
not scoredOpen access status: Not checked or no result supplied; no credibility inference made. Source: No authority result supplied; license: Unknown
not scoredPublication license: Not checked or no result supplied; no credibility inference made. Source: No authority result supplied; license: Unknown
not scoredPublication version: A publication version was supplied but is not scored. Source: Normalized work metadata; license: Caller-provided; provenance license not supplied to scorer
cautionMetadata completeness: 5 of 6 scored descriptive metadata groups are present; missing fields increase uncertainty. Source: Normalized work metadata; license: Caller-provided; provenance license not supplied to scorer

Cite this work

BibTeX

@article{allodium:10.1109/tpami.2026.3669975,
  title = {Near-perfect Clustering Based on Recursive Binary Splitting Using Max-MMD.},
  author = {Chakrabarty S and Chakraborty A and De SK},
  year = {2026},
  journal = {IEEE transactions on pattern analysis and machine intelligence},
  doi = {10.1109/tpami.2026.3669975},
  url = {https://doi.org/10.1109/tpami.2026.3669975}
}

RIS

TY  - JOUR
TI  - Near-perfect Clustering Based on Recursive Binary Splitting Using Max-MMD.
AU  - Chakrabarty S
AU  - Chakraborty A
AU  - De SK
PY  - 2026
JO  - IEEE transactions on pattern analysis and machine intelligence
DO  - 10.1109/tpami.2026.3669975
UR  - https://doi.org/10.1109/tpami.2026.3669975
ER  -

APA

S, C., A, C., & SK, D. (2026). Near-perfect Clustering Based on Recursive Binary Splitting Using Max-MMD.. IEEE transactions on pattern analysis and machine intelligence. https://doi.org/10.1109/tpami.2026.3669975

Source records

pubmed · retrieved 2026-09-25T01:45:39.231Z