Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

An adaptive spectral clustering algorithm based on the importance of shared nearest neighbors

From MaRDI portal
Publication:1736648
Jump to:navigation, search

DOI10.3390/a8020177zbMath1461.62097OpenAlexW1577476228MaRDI QIDQ1736648

Xiaoqi He, Yangguang Liu, Sheng Zhang

Publication date: 26 March 2019

Published in: Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3390/a8020177


zbMATH Keywords

similarity measuresspectral clusteringGaussian kernel functionimportance of nearest neighbors


Mathematics Subject Classification ID

Classification and discrimination; cluster analysis (statistical aspects) (62H30)


Related Items (2)

Adaptive density-based clustering algorithm with shared KNN conflict game ⋮ Trajectory clustering and \(k\)-NN for robust privacy preserving spatiotemporal databases


Uses Software

  • UCI-ml


Cites Work

  • Robust path-based spectral clustering
  • Authoritative sources in a hyperlinked environment
  • A Measure of Similarity between Graph Vertices: Applications to Synonym Extraction and Web Searching


This page was built for publication: An adaptive spectral clustering algorithm based on the importance of shared nearest neighbors

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1736648&oldid=14065013"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 1 February 2024, at 07:43.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki