SCOPUS 정보 검색 플랫폼

Advances in Neural Information Processing Systems

Volumn , Issue , 2005, Pages 979-986

Q-clustering

(3) Narasimhan, Mukund a Jojic, Nebojsa b Bilmes, Jeff a

a University of Washington (United States)

b MICROSOFT RESEARCH (United States)

Author keywords

[No Author keywords available]

Indexed keywords

APPLICATION SPECIFIC; CLUSTERINGS; GENERATIVE MODEL; K CLUSTER; MDL CRITERION; MINIMUM DESCRIPTION LENGTH CRITERIA; MINIMUM DISTANCE; OBJECTIVE FUNCTIONS; OPTIMAL CLUSTERING; OPTIMAL PARTITIONING; OPTIMALITY; POLYNOMIAL-TIME; SINGLE LINKAGE; SUBMODULAR FUNCTIONS; TRACTABLE ALGORITHMS;

OPTIMIZATION; POLYNOMIAL APPROXIMATION;

CLUSTERING ALGORITHMS;

EID: 78649332845 PISSN: 10495258 EISSN: None Source Type: Conference Proceeding
DOI: None Document Type: Conference Paper

Times cited : (64)

References (9)

1
- 0002836025
- Minimizing symmetric submodular functions
- M. Queyranne. "Minimizing symmetric submodular functions", Math. Programming, 82, pages 3-12. 1998.
- (1998) Math. Programming , vol.82 , pp. 3-12
- Queyranne, M.¹

2
- 0039550359
- On Minimizing symmetric set functions
- R. Rizzi, "On Minimizing symmetric set functions", Combinatorica 20(3), pages 445-450, 2000.
- (2000) Combinatorica , vol.20 , Issue.3 , pp. 445-450
- Rizzi, R.¹

3
- 84898944155
- Maximum margin clustering
- L. Xu, J. Neufeld, B. Larson and D. Schuurmans. "Maximum Margin Clustering", in Advances in Neural Information Processing Systems 17, pages 1537-1544, 2005.
- (2005) Advances in Neural Information Processing Systems , vol.17 , pp. 1537-1544
- Xu, L.¹ Neufeld, J.² Larson, B.³ Schuurmans, D.⁴

4
- 6344233909
- Finding haplotype tagging SNPs by use of principal components analysis
- Z. Lin and R. B. Altman. "Finding Haplotype Tagging SNPs by Use of Principal Components Analysis", Am. J. Hum. Genet. 75, pages 850-861, 2004.
- (2004) Am. J. Hum. Genet. , vol.75 , pp. 850-861
- Lin, Z.¹ Altman, R.B.²

5
- 0004161991
- Englewood Cliffs, N.J.: Prentice Hall
- Jain, A.K. and R.C. Dubes, "Algorithms for Clustering Data." Englewood Cliffs, N.J.: Prentice Hall, 1988.
- (1988) Algorithms for Clustering Data
- Jain, A.K.¹ Dubes, R.C.²

6
- 0001773546
- On the complexity of clustering problems
- R. Henn, B. Korte, and W. Oletti (eds.), Lecture Notes in Economics and Mathematical Systems, Springer, Berlin
- P. Brucker, "On the complexity of clustering problems," in R. Henn, B. Korte, and W. Oletti (eds.), Optimization and Operations Research, Lecture Notes in Economics and Mathematical Systems, Springer, Berlin 157.
- Optimization and Operations Research , pp. 157
- Brucker, P.¹

7
- 33244480588
- An MDL framework for data clustering
- P. Kontkanen, P. Myllymäki, W. Buntine, J. Rissanen and H. Tirri. "An MDL framework for data clustering", HIIT Technical Report 2004.
- (2004) HIIT Technical Report
- Kontkanen, P.¹ Myllymäki, P.² Buntine, W.³ Rissanen, J.⁴ Tirri, H.⁵

8
- 0019037938
- Bicriterion cluster analysis
- M. Delattre and P. Hansen. "Bicriterion Cluster Analysis", IEEE Transactions on Pattern Analysis and Machine Intelligence, Vol-2, No. 4, 1980
- (1980) IEEE Transactions on Pattern Analysis and Machine Intelligence , vol.2 , Issue.4
- Delattre, M.¹ Hansen, P.²

9
- 70449611166
- Q-Clustering
- University of Washington, UWEETR-2006-0001
- M. Narasimhan, N. Jojic and J. Bilmes. "Q-Clustering", Technical Report, Dept. of Electrical Engg., University of Washington, UWEETR-2006-0001, 2005
- (2005) Technical Report, Dept. of Electrical Engg.
- Narasimhan, M.¹ Jojic, N.² Bilmes, J.³

* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.