Selection of the Suitable Neighborhood Size for the ISOMAP Algorithm.
Chao ShaoHoukuan HuangChunhong WanPublished in: IJCNN (2007)
Keyphrases
- computational complexity
- selection algorithm
- dynamic programming
- recognition algorithm
- k means
- objective function
- optimal solution
- preprocessing
- cost function
- experimental evaluation
- detection algorithm
- matching algorithm
- np hard
- space complexity
- scales linearly
- memory requirements
- times faster
- worst case time complexity
- learning algorithm
- worst case
- computational cost
- significant improvement
- optimization algorithm
- expectation maximization
- clustering method
- euclidean distance
- particle swarm optimization
- input data
- dimension reduction
- distance measure
- window size
- fixed size
- neighborhood graph
- search space
- neural network