Signal Processing and Optimization Tools for Conference Review and Session Assignment

IEEE Signal Processing Magazine

Volumn 32, Issue 3, 2015, Pages 141-155

  Sidiropoulos, Nicholas D ^a   Tsakonas, Efthymios ^b  

^a ARISTOTLE UNIVERSITY OF THESSALONIKI   (Greece)

^b TECHNICAL UNIVERSITY OF CRETE   (Greece)

Author keywords

[No Author keywords available]

Indexed keywords

COMBINATORIAL OPTIMIZATION; COMPLEX NETWORKS; PAPER; SENSOR NETWORKS;

ALGORITHMIC SOLUTIONS; APPROXIMATE SOLUTION; CAPACITY CONSTRAINTS; MODERATE COMPLEXITY; OPTIMAL ASSIGNMENT; OPTIMIZATION TOOLS; SCIENTIFIC CONTENT; TECHNICAL PROGRAMS;

SIGNAL PROCESSING;

EID: 85032751878     PISSN: 10535888     EISSN: None     Source Type: Journal    
DOI: 10.1109/MSP.2014.2359230     Document Type: Article

References (40)

1. D. Hartvigsen, J. Wei, and R. Czuchlewski, "The conference paper-reviewer assignment problem," Decision Sci., vol. 30, no. 3, pp. 865-876, 1999.
2. C. Taylor, "On the optimal assignment of conference papers to reviewers,"Tech. Rep. MS-CIS-08-30, Dept. Comput. Inform. Sci., Univ. Pennsylvania, Dec. 2008.
3. th Association for Computing Machinery's Special Interest Group on Knowledge Discovery and Data Mining (ACM SIGKDD), 2006, pp. 862-871.
4. th ACM Conf. Information and Knowledge Management (CIKM 2008), Napa Valley, CA, pp. 1113-1122.
5. th Ed. New York: Academic Press, 2008.
6. C. Bishop, Pattern Recognition and Machine Learning. New York: Springer, 2006.
7. R. Baeza-Yates and B. Ribeiro-Neto, Modern Information Retrieval. Boston, MA: ACM Press and Addison-Wesley, 1999.
8. E. Papalexakis, N. D. Sidiropoulos, and M. Garofalakis, "Reviewer profiling using sparse matrix regression," in Proc. 2010 IEEE International Conf. Data Mining (ICDM) Workshops/Workshop on Optimization Based Methods for Emerging Data Mining Problems (OEDM), Sydney, Australia, Dec. 2010, pp. 1214-1219.
9. S. Dumais and J. Nielsen, "Automating the assignments of submitted manuscripts to reviewers," in Proc. Association for Computing Machinery Special Interest Group on Information Retrieval, 1992, pp. 233-244.
10. F. Wang, B. Chen, and Z. Miao, "A survey on reviewer assignment problem,"Lect. Notes Comput. Sci., vol. 5027, pp. 718-727, 2008.
11. S. Janak, M. Taylor, C. Floudas, M. Burka, and T. Mountziaris. (2006). A novel and effective integer optimization approach for the NSF panel assignment problem: A multi-resource and preference-constrained generalized assignment problem. Ind. Eng. Chem. Res. 45, pp. 258-265. [Online]. Available: http://ares.princeton.edu/casl-nsf-mgap/login.php
12. P. Hahn, B. Kim, M. Guignard, J. Smith, and Y. Zhu, "An algorithm for the generalized quadratic assignment problem," Comput. Optim. Appl. (Springer), vol. 40, no. 3, pp. 351-372, July 2008.
13. R. Burkard, M. Dell'Amico, and S. Martello, Assignment Problems. Philadelphia, PA: SIAM, 2009.
14. A. Jain, M. Murty, and P. Flynn, "Data clustering: A review," ACM Comput. Surv., vol. 31, no. 3, pp. 264-323, Sept. 1999.
15. th Int. Conf. Machine Learning, 2001, pp. 577-584.
16. I. Davidson and S. Ravi, "Clustering with constraints: Feasibility issues and the k-means algorithm," in Proc. 2005 SIAM Int. Conf. Data Mining.
17. P. Bradley, K. Bennett, and A. Demiriz, "Constrained k -means clustering,"Tech. Rep. TR-2000-65, Microsoft Research, 2000.
18. S. Boyd and L. Vandenberghe. (2004). Convex Optimization. [Online]. Cambridge, U.K.: Cambridge Univ. Press. Available: http://www.stanford.edu/~boyd/cvxbook.html
19. J. Peng and Y. Wei, "Approximating k-means-type clustering via semidefinite programming," SIAM J. Optim., vol. 18, no. 1, pp. 186-205, 2007.
20. K. Jain and R. Dubes, Algorithms for Clustering Data. Englewood Cliffs, NJ: Prentice Hall, 1988.
21. L. Kaufman and P. Rousseeuw, Finding Groups in Data, an Introduction to Cluster Analysis. New York: Wiley, 1990.
22. H. Wolkowicz, "Relaxations of Q2P," in Handbook of Semidefinite Programming: Theory, Algorithms, and Applications, H. Wolkowicz, R. Saigal, and L. Vandenberghe, Eds. Norwell, MA: Kluwer, 2000, Ch. 13.4, pp. 395-419.
23. S. P. Lloyd, "Least squares quantization in PCM," IEEE Trans. Inform. Theory, vol. 28, pp. 129-137, Mar. 1982.
24. J. Max, "Quantizing for minimum distortion," IRE Trans. Inform. Theory, vol. 6, pp. 7-12, Mar. 1960.
25. Y. Linde, A. Buzo, and R. Gray, "An algorithm for vector quantizer design,"IEEE Trans. Commun., vol. 28, no. 1, pp. 84-95, Jan. 1980.
26. D. Aloise, A. Deshpande, P. Hansen, and P. Popat, "NP-hardness of Euclidean sum-of-squares clustering," Mach. Learn., vol. 75, pp. 245-248, May 2009.
27. S. Dasgupta and Y. Freund, "Random projection trees for vector quantization,"IEEE Trans. Inform. Theory, vol. 55, pp. 3229-3242, July 2009.
28. P. Crescenzi and V. Kann. A compendium of NP optimization problems. [Online]. Available: http://www.nada.kth.se/~viggo.
29. N. Guttmann-Beck and R. Hassin, "Approximation algorithms for minimum sum p-clustering," Disc. Appl. Math. vol. 89, nos. 1-3, pp. 125-142, Dec. 1998.
30. J. Kennington and Z. Wang, "A shortest augmenting path algorithm for the semi-assignment problem," Operations Res., vol. 40, no. 1, pp. 178-187, Feb. 1992.
31. G. Birkhoff, "Tres observaciones sobre el algebra lineal," Universidad Nacional de Tucuman Revista, vol. 5, pp. 147-151, 1946.
32. D. Bertsimas and J. Tsitsiklis, Introduction to Linear Optimization. Belmont, MA: Athena Scientific, 1997.
33. MOSEK ApS. The MOSEK optimization toolbox for MATLAB manual. [Online]. Available: http://docs.mosek.com/7.0/toolbox.pdf
34. Q. Zhao, S. Karisch, F. Rendl, and H. Wolkowicz, "Semidefinite programming relaxations for the quadratic assignment problem," J. Combinatorial Optim., vol. 2, no. 1, pp. 71-109, 1998.
35. J. Povh and F. Rendl, "Copositive and semidefinite relaxations of the quadratic assignment problem," Discrete Optim., vol. 6, no. 3, pp. 231-241, Aug. 2009.
36. M. Goemans and D. Williamson, "Improved approximation algorithms for maximum cut and satisfiability problem using semidefinite programming," J. ACM, vol. 42, no. 6, pp. 1115-1145, Nov. 1995.
37. Z. Q. Luo, W. K. Ma, A. M. C. So, Y. Ye, and S. Zhang, "Semidefinite relaxation of quadratic optimization problems," IEEE Signal Processing Mag., vol. 27, no. 3, pp. 20-34, May 2010.
38. P. Tseng, "Further results on approximating nonconvex quadratic optimization by semidefinite programming relaxation," SIAM J. Optim., vol. 14, no. 1, pp. 268-283, July 2003.
39. S. Zhang, "Quadratic maximization and semidefinite relaxation," Math. Program., vol. 87, no. 3, pp. 453-465, May 2000.
40. A. Banerjee, S. Merugu, I. S. Dhillon, and J. Ghosh, "Clustering with Bregman divergences," J. Mach. Learn. Res., vol. 6, pp. 1705-1749, 2005.