Skip to main content

2020 | OriginalPaper | Buchkapitel

A Subspace Similarity-Based Data Clustering by Delaunay Triangulation

verfasst von : Ebinezar, S. Subashini, D. Stalin Alex, P. Subramanian

Erschienen in: Innovations in Computer Science and Engineering

Verlag: Springer Singapore

Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.

search-config
loading …

Abstract

Grouping data suffers from the curse of dimensionality and similarity functions that use all input features with equal relevance may not be effective and the features should be common to complete data. In this paper, Delaunay triangulation method is used to discover and cluster the subspace similarity-based data and finds the closest neighbors by similarity measures, and the triangulation drawing can be done repetitively over the space and cluster. This method avoids the risk of loss of information in any assumed distributed model, and it is a geometric model finds empty circles without any points, only the corner points of the triangles having related points.

Sie haben noch keine Lizenz? Dann Informieren Sie sich jetzt über unsere Produkte:

Springer Professional "Wirtschaft+Technik"

Online-Abonnement

Mit Springer Professional "Wirtschaft+Technik" erhalten Sie Zugriff auf:

  • über 102.000 Bücher
  • über 537 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Maschinenbau + Werkstoffe
  • Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

Springer Professional "Technik"

Online-Abonnement

Mit Springer Professional "Technik" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 390 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Maschinenbau + Werkstoffe




 

Jetzt Wissensvorsprung sichern!

Springer Professional "Wirtschaft"

Online-Abonnement

Mit Springer Professional "Wirtschaft" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 340 Zeitschriften

aus folgenden Fachgebieten:

  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Versicherung + Risiko




Jetzt Wissensvorsprung sichern!

Literatur
1.
Zurück zum Zitat Park SB, Lee JW, Kim SK (2004) Content-based image classification uses a neural network, vol 25, Issue 3, pp 287–300. Elsevier Park SB, Lee JW, Kim SK (2004) Content-based image classification uses a neural network, vol 25, Issue 3, pp 287–300. Elsevier
2.
Zurück zum Zitat Zhang W, Mao L, Xu W (2009) Automatic image classification using the classification ant colony algorithm. 10.1109/ESIAT.2009.280 Zhang W, Mao L, Xu W (2009) Automatic image classification using the classification ant colony algorithm. 10.1109/ESIAT.2009.280
3.
Zurück zum Zitat Delaunay B, Sur la sph_ere vide, Izvestia Akademia Nauk SSSR (1934) VII Seria, Otdelenie Matematicheskii i Estestvennyka Nauk, vol 7, pp 793–800 Delaunay B, Sur la sph_ere vide, Izvestia Akademia Nauk SSSR (1934) VII Seria, Otdelenie Matematicheskii i Estestvennyka Nauk, vol 7, pp 793–800
5.
Zurück zum Zitat Hjelle Y, D_hlen M (2006) Triangulations and applications. Mathematics and visualization. Springer, Berlin. ISBN:978-3-540-33260-2 Hjelle Y, D_hlen M (2006) Triangulations and applications. Mathematics and visualization. Springer, Berlin. ISBN:978-3-540-33260-2
6.
Zurück zum Zitat Dyken, Floater (2006) Preferred directions for resolving the non-uniqueness of delaunay triangulations. CGTA: Comput Geom Theory Appl 34(2):96–101MathSciNetCrossRef Dyken, Floater (2006) Preferred directions for resolving the non-uniqueness of delaunay triangulations. CGTA: Comput Geom Theory Appl 34(2):96–101MathSciNetCrossRef
7.
Zurück zum Zitat Maus Arne (1984) Delaunay triangulation and the convex hull of n points in expected linear time. BIT 24:151–163MathSciNetCrossRef Maus Arne (1984) Delaunay triangulation and the convex hull of n points in expected linear time. BIT 24:151–163MathSciNetCrossRef
8.
Zurück zum Zitat Wikipedia: Delaunay triangulation http://wikipedia:org=wiki=Delaunaytriangulation Wikipedia: Delaunay triangulation http://​wikipedia:org=wiki=Delaunaytriangulation
9.
Zurück zum Zitat Jiang C, Coenen F, Sanderson R, Zito M (2008) Text classification using graph mining-based feature extraction Jiang C, Coenen F, Sanderson R, Zito M (2008) Text classification using graph mining-based feature extraction
10.
Zurück zum Zitat Xu R, Kit C (2010) Incorporating feature-based and similarity-based opinion mining CTL in NTCIR-8 MOAT. In: Proceedings of NTCIR-8 workshop meeting, June 15–18, Tokyo, Japan Xu R, Kit C (2010) Incorporating feature-based and similarity-based opinion mining CTL in NTCIR-8 MOAT. In: Proceedings of NTCIR-8 workshop meeting, June 15–18, Tokyo, Japan
11.
Zurück zum Zitat Jin W, Ho H, Srihari R (2009) Opinion miner: a novel machine learning system for web opinion mining and extraction. In: Proceedings of the 15th ACM SIGKDD international conference on knowledge discovery and data mining, pp. 1195–1204. ACM Jin W, Ho H, Srihari R (2009) Opinion miner: a novel machine learning system for web opinion mining and extraction. In: Proceedings of the 15th ACM SIGKDD international conference on knowledge discovery and data mining, pp. 1195–1204. ACM
12.
Zurück zum Zitat Dhasal P, Shrivastava SS (2012 Sept) An optimized feature selection for image classification based on SVMACO. IJACR 2(3) Issue-5. ISSN (online): 2277-7970) Dhasal P, Shrivastava SS (2012 Sept) An optimized feature selection for image classification based on SVMACO. IJACR 2(3) Issue-5. ISSN (online): 2277-7970)
13.
Zurück zum Zitat Jia H, Cheung Y-M (2018) Subspace clustering of categorical and numerical data with an unknown number of clusters. IEEE Trans Neural Netw Learn Syst 29(8):3308–3325MathSciNetCrossRef Jia H, Cheung Y-M (2018) Subspace clustering of categorical and numerical data with an unknown number of clusters. IEEE Trans Neural Netw Learn Syst 29(8):3308–3325MathSciNetCrossRef
14.
Zurück zum Zitat Yang J, Liang J, Wang K, Yang Y-L, Cheng M-M (2018) Automatic model selection in subspace clustering via triplet relationships. In: Proceedings of AAAI, pp. 4358–4365 Yang J, Liang J, Wang K, Yang Y-L, Cheng M-M (2018) Automatic model selection in subspace clustering via triplet relationships. In: Proceedings of AAAI, pp. 4358–4365
15.
Zurück zum Zitat Zhu P, Zhu W, Hu Q, Zhang C, Zuo W (2017 June) Subspace clustering guided unsupervised feature selection. In: Pattern Recognition, vol. 66, pp. 364–374. Elsevier Zhu P, Zhu W, Hu Q, Zhang C, Zuo W (2017 June) Subspace clustering guided unsupervised feature selection. In: Pattern Recognition, vol. 66, pp. 364–374. Elsevier
Metadaten
Titel
A Subspace Similarity-Based Data Clustering by Delaunay Triangulation
verfasst von
Ebinezar
S. Subashini
D. Stalin Alex
P. Subramanian
Copyright-Jahr
2020
Verlag
Springer Singapore
DOI
https://doi.org/10.1007/978-981-15-2043-3_65