期刊
TOPOLOGY AND ITS APPLICATIONS
卷 342, 期 -, 页码 -出版社
ELSEVIER
DOI: 10.1016/j.topol.2023.108760
关键词
Typed topology; Data mining; DBSCAN algorithm
The concept of typed topology is introduced, and its application in finite data sets and data clustering is discussed. Several related concepts, such as tracks, ports, and branches, are introduced for finite typed topological spaces.
The concept of typed topology is introduced. In a typed topological space, some open sets are assigned types, and topological concepts such as closure, connectedness can be defined using types. A finite data set in R2 is a typically typed topological space. Clusters calculated by the DBSCAN algorithm for data clustering can be well represented in a finite typed topological space. Other concepts such as tracks, port (starting points), type-p-connectedness, p-closure-connectedness, indexing, branches are also introduced for finite typed topological spaces. Finally, left - r and up - left - r type open sets are introduced for finite data sets in R2, so that tracks, port, branches can be calculated.(c) 2023 Elsevier B.V. All rights reserved.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据