메뉴 건너뛰기




Volumn 1, Issue , 2008, Pages 301-312

Clustering from constraint graphs

Author keywords

[No Author keywords available]

Indexed keywords

DATA MINING; GRAPH THEORY; PETROLEUM RESERVOIR EVALUATION;

EID: 52649149832     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1137/1.9781611972788.27     Document Type: Conference Paper
Times cited : (3)

References (13)
  • 2
    • 38049108303 scopus 로고    scopus 로고
    • Structuring continuous video recordings of everyday life using time-constrained clustering
    • San Jose, CA, January
    • Wei-Hao Lin and Alexander Hauptmann. Structuring continuous video recordings of everyday life using time-constrained clustering. In IS&T/SPIE Symposium on Electronic Imaging, San Jose, CA, January 2006.
    • (2006) IS&T/SPIE Symposium on Electronic Imaging
    • Lin, W.-H.1    Hauptmann, A.2
  • 4
    • 84880095768 scopus 로고    scopus 로고
    • Clustering with constraints: Feasibility issues and the k-means algorithm
    • Ian Davidson and S. S. Ravi. Clustering with constraints: Feasibility issues and the k-means algorithm. In 5th SIAM Data Mining Conference, 2005.
    • (2005) 5th SIAM Data Mining Conference
    • Davidson, I.1    Ravi, S.S.2
  • 6
    • 9444230302 scopus 로고    scopus 로고
    • Semi-supervised clustering with user feedback
    • Technical report, Cornell University, TR2003-1892
    • David Cohn, Rich Caruana, and Andrew McCallum. Semi-supervised clustering with user feedback. Technical report, Cornell University, 2003. TR2003-1892.
    • (2003)
    • Cohn, D.1    Caruana, R.2    McCallum, A.3
  • 8
    • 37149035843 scopus 로고    scopus 로고
    • Clustering with constraints: Theory and practice
    • Sugato Basu and Ian Davidson. Clustering with constraints: Theory and practice. Online Proceedings of a KDD tutorial, 2006. http://www.ai.sri.com/ ~basu/kdd-tutorial-2006/.
    • (2006) Online Proceedings of a KDD tutorial
    • Basu, S.1    Davidson, I.2
  • 10
    • 11944253901 scopus 로고    scopus 로고
    • 2nd ed, Cambridge University Press
    • Bella Bollobás. Random Graphs (2nd ed.). Cambridge University Press, 2001.
    • (2001) Random Graphs
    • Bollobás, B.1
  • 13
    • 38049121185 scopus 로고    scopus 로고
    • k-means with large and noisy constraint sets
    • Dan Pelleg and Dorit Baras, k-means with large and noisy constraint sets. In ECML, pages 674-682, 2007.
    • (2007) ECML , pp. 674-682
    • Pelleg, D.1    Baras, D.2


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