A hybrid clustering algorithm

Computers and Operations Research

Volumn 34, Issue 11, 2007, Pages 3255-3269

  Osei Bryson, Kweku Muata ^a   Inniss, Tasha R ^b  

^a VIRGINIA COMMONWEALTH UNIVERSITY   (United States)

^b SPELMAN COLLEGE   (United States)

Author keywords

Clustering; Parametric linear programming; Segmentation; Sequential partitioning; Spectral analysis

Indexed keywords

DATA STRUCTURES; LINEAR PROGRAMMING; SPECTRUM ANALYSIS;

SEQUENTIAL CLUSTERING; SEQUENTIAL PARTITIONING;

CLUSTERING ALGORITHMS;

EID: 34047182489     PISSN: 03050548     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.cor.2005.12.004     Document Type: Article

References (19)

1. Kernighan B. Optimal sequential partitions of graphs. Journal of the Association for Computing Machinery 18 (1971) 34-40
2. Hwang F. A generalized binomial grouping testing problem. Journal of the American Statistical Association 53 (1975) 923-926
3. Chakravarty A., Orlin J., and Rothblum V. A partitioning problem with additive objective with an application to optimal inventory groupings for joint replenishment. Operations Research 30 (1982) 1018-1020
4. Joseph A., and Bryson N. Partitioning of sequential ordered systems using linear programming. Computers and Operations Research 24 7 (1997) 679-686
5. Joseph A., and Bryson N. W-efficient partitions and the solution of the sequential clustering problem. Annals of Operations Research. Nontraditional Approaches to Statistical Classification 74 (1997) 305-319
6. Inniss T. Seasonal clustering technique for time series data. European Journal of Operational Research 2005, in press.
7. Gass S., and Saaty T. The computational algorithm for the parametric objective function. Naval Research Logistics Quarterly 2 (1955) 39-45
8. Nemhauser G., and Wolsey L. Integer and combinatorial optimization (1988), Wiley, New York
9. Borgwardt K.-H. The average number of steps required by the simplex method is polynomial. Zeitchrift fur Operations Research 26 (1982) 157-177
10. Shekkar S., and Liu D. Partitioning similarity graphs. a framework for declustering problems. Information Systems 21 6 (1996) 475-496
11. Faloutsos C., and Lin K.-I. FastMap. a fast algorithm for the indexing, data mining, and visualization of traditional and multimedia datasets. ACM SIGMOD proceedings (1995) 163-174
12. Hagen L., and Kahng A. New spectral methods for ratio cut partitioning and clustering. IEEE Transactions on Computed Aided Design 11 9 (1992) 1074-1085
13. Alpert C., and Yao S. Spectral partitioning. the more eigenvectors, the better. 32nd ACM/IEEE Design Automation Conference. San Francisco (1995) 195-200
14. Dhillon I. Co-clustering documents and words using bipartite spectral graph partitioning. Proceedings of the seventh ACM SIGKDD, San Francisco, CA (2001) 269-274
15. Ding C., and He X. Linearized cluster assignment via spectral ordering. ACM proceedings of the 21st international conference on machine learning vol. 30 (2004)
16. McQueen J. Some methods for classification and analysis of multivariate observations. In: Lecam L.M., and Neyman J. (Eds). Proceedings of the fifth Berkeley symposium on mathematical statistics and probability (1967) 281-297
17. Johnson S. Hierarchical clustering schemes. Psychometrika 2 (1967) 241-254
18. Karmarkar N. A new polynomial-time algorithm for linear programming. Combinatorica 4 (1984) 373-395
19. Ward J. Hierarchical grouping to optimize an objective function. Journal of American Statistical Association 1993; 58:236-44.