Clustering in Hypergraphs to Minimize Average Edge Service Time.
Ori RottenstreichHaim KaplanAvinatan HassidimPublished in: ESA (2017)
Keyphrases
- clustering algorithm
- k means
- edge detection
- information theoretic
- clustering method
- edge information
- neural network
- graph theoretic
- standard deviation
- service oriented
- hierarchical clustering
- data clustering
- management system
- service providers
- cluster analysis
- end users
- web services
- search engine
- semantic web services
- data sets
- document clustering
- data points
- similarity function
- edge detector
- graph theory
- service composition