Location:
Search - dbscan
Search list
Description: 基于密度的聚类算法
它将簇定义为密度相连的点的最大集合，能够把具有足够高密度的区域划分为簇，并可在噪声的空间数据库中发现任意形状的聚类(Density based clustering algorithm
It defines the cluster as the largest set of density connected points, and can divide the region with enough high density into clusters, and can find clusters of arbitrary shape in the spatial database of noise)
Platform: |
Size: 3072 |
Author: 微染 |
Hits:
Description: 矢量网络法散将射参数转化为介电常数
本代码计算需要的输入值为：d(超材料厚度方向的周期常数)，f(频率的变化范围)，S(通过CST或HFSS软件计算得到的散射参数)(The vector network dispersion transforms the radiation parameters into the dielectric constant
Input values required for calculation in this code are: D (periodic constant in the direction of metamaterial thickness), F (range of frequency variation), S(scattering parameters calculated by CST or HFSS software))
Platform: |
Size: 14336 |
Author: frredead |
Hits:
Description: Java implementation for DBSCANSD, a trajectory clustering algorithm.
DBSCANSD (Density-Based Spatial Clustering of Applicationswith Noise considering Speed and Direction)[1] is a clustering algorithm extended from DBSCAN [2]. It can consider speed and direction, which is essential for maritime lanes extraction. The output of this algorithm is a set of Gravity Vectors (GV) and Sampled Stopping Points (SSP).
In the present version, the implementation has not included generating SSP yet, but I shall add this part later.
Since the AIS data provided for this project is confidential, I cannot upload it to github as example. But I generated a toy data set and put it in the src folder which can be tested with the program. And it will be great if you use this algorithm for other domains' problems, such as tracking data of vehicles, pedestrian, hurricane or animals.
More details about this algorithm can be found in [1]. The link is as following:
http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=7004281
Platform: |
Size: 2772182 |
Author: 648577896 |
Hits:
Description: # How To Run The Code ?
After downloading it to local,
1. cd to the folder of src/boliu/dbscansd/
2. compile all the .java files using:
javac *.java
3. cd to the folder of src/
4. execute the program using the following either command:
java boliu.dbscansd.Main inputfile outputfile lineNum eps minPts maxSpd maxDir isStop
* @param inputfile the input file path
* @param outputfile the output file path
* @param lineNum the designated number of trajectory points for clustering (if the size of the input file is less than lineNum, it will extract all the points)
* @param eps 1st parameter of DBSCANSD, the radius
* @param minPts 2nd parameter of DBSCANSD, the minimum number of points
* @param maxSpd 3rd parameter of DBSCANSD, the maximum SOG difference
* @param maxDir 4th parameter of DBSCANSD, the maximum COG difference
* @param isStop boolean value (0/1), if you would like to cluster stopping points (1) or moving points (0)
--e.g. java boliu.dbscansd.Main toy_data.csv output 70000 0.03 50 2 2.5 0
In this way, the program will do the job on toy_data.csv file.
It will extract the first 70,000 moving points from the data and then run DBSCANSD on the dataset.
The final output will be two files:
output_gv.csv (gravity vectors)
output_movingclusters.csv (original clustering results with more rows).
5. waiting for the result :) The running time will vary with different sizes of the input data and other input parameters.
6. Star it if it helps \*-\*
Platform: |
Size: 11994582 |
Author: 648577896 |
Hits:
«
1
2
...
11
12
13
14
15
16»