메뉴 건너뛰기




Volumn 31, Issue 2, 2012, Pages 251-279

Sleeved co-clustering of lagged data

Author keywords

Clustering; Co clustering; Data mining; Lagged clustering; Time lagged

Indexed keywords


EID: 84859896284     PISSN: 02191377     EISSN: 02193116     Source Type: Journal    
DOI: 10.1007/s10115-011-0420-6     Document Type: Article
Times cited : (6)

References (53)
  • 1
    • 0032885005 scopus 로고    scopus 로고
    • Survey of spatio-temporal databases
    • Abraham T, Roddick J (1999) Survey of spatio-temporal databases. GeoInformatica 3(1): 61-99.
    • (1999) GeoInformatica , vol.3 , Issue.1 , pp. 61-99
    • Abraham, T.1    Roddick, J.2
  • 2
    • 0942288271 scopus 로고    scopus 로고
    • Covering rectilinear polygons with axis-parallel rectangles
    • Anil Kumar V, Ramesh H (2003) Covering rectilinear polygons with axis-parallel rectangles. SIAM J Comput 32(6): 1509-1541.
    • (2003) SIAM J Comput , vol.32 , Issue.6 , pp. 1509-1541
    • Anil Kumar, V.1    Ramesh, H.2
  • 3
    • 84859915217 scopus 로고    scopus 로고
    • BicFinder: A biclustering algorithm for microarray data analysis
    • Ayadi W, Elloumi M, Hao J (2011) BicFinder: a biclustering algorithm for microarray data analysis. Knowl Inf Syst, pp 1-18.
    • (2011) Knowl Inf Syst , pp. 1-18
    • Ayadi, W.1    Elloumi, M.2    Hao, J.3
  • 5
    • 80053313853 scopus 로고    scopus 로고
    • Measuring gene similarity by means of the classification distance
    • Baralis E, Bruno G, Fiori A (2011) Measuring gene similarity by means of the classification distance. Knowl Inf Syst, pp 1-21.
    • (2011) Knowl Inf Syst , pp. 1-21
    • Baralis, E.1    Bruno, G.2    Fiori, A.3
  • 6
    • 0036100113 scopus 로고    scopus 로고
    • Context-specific Bayesian clustering for gene expression data
    • Barash Y, Friedman N (2002) Context-specific Bayesian clustering for gene expression data. J Comput Biol 9(2): 169-191.
    • (2002) J Comput Biol , vol.9 , Issue.2 , pp. 169-191
    • Barash, Y.1    Friedman, N.2
  • 7
    • 37049252093 scopus 로고
    • Dynamic programming
    • Bellman R (1966) Dynamic programming. Science 153(3731): 34-37.
    • (1966) Science , vol.153 , Issue.3731 , pp. 34-37
    • Bellman, R.1
  • 8
    • 0006727665 scopus 로고    scopus 로고
    • Complexities of efficient solutions of rectilinear polygon cover problems
    • Berman P, DasGupta B (1997) Complexities of efficient solutions of rectilinear polygon cover problems. Algorithmica 17(4): 331-356.
    • (1997) Algorithmica , vol.17 , Issue.4 , pp. 331-356
    • Berman, P.1    Dasgupta, B.2
  • 11
    • 42649110359 scopus 로고    scopus 로고
    • A pattern recognition approach to infer time-lagged genetic interactions
    • Chuang C, Jen C, Chen C, Shieh G (2008) A pattern recognition approach to infer time-lagged genetic interactions. Bioinformatics 24(9): 1183-1190.
    • (2008) Bioinformatics , vol.24 , Issue.9 , pp. 1183-1190
    • Chuang, C.1    Jen, C.2    Chen, C.3    Shieh, G.4
  • 15
    • 0034710876 scopus 로고    scopus 로고
    • Coupled two-way clustering analysis of gene microarray data
    • Getz G, Levine E, Domany E (2000) Coupled two-way clustering analysis of gene microarray data. Proc Natl Acad Sci 97(22): 12079-12084.
    • (2000) Proc Natl Acad Sci , vol.97 , Issue.22 , pp. 12079-12084
    • Getz, G.1    Levine, E.2    Domany, E.3
  • 16
    • 0000351727 scopus 로고
    • Investigating causal relations by econometric models and cross-spectral methods
    • Granger C (1969) Investigating causal relations by econometric models and cross-spectral methods. Econometr J Econometr Soc 37(3): 424-438.
    • (1969) Econometr J Econometr Soc , vol.37 , Issue.3 , pp. 424-438
    • Granger, C.1
  • 17
    • 0000109157 scopus 로고    scopus 로고
    • Clique is hard to approximate within 1-ε
    • Håstad J (1999) Clique is hard to approximate within 1-ε. Acta Math 182(1): 105-142.
    • (1999) Acta Math , vol.182 , Issue.1 , pp. 105-142
    • Håstad, J.1
  • 19
    • 84893405732 scopus 로고    scopus 로고
    • Data clustering: a review
    • Jain A, Murty M, Flynn P (1999) Data clustering: a review. ACM Comput Surv 31(3): 264-323.
    • (1999) ACM Comput Surv , vol.31 , Issue.3 , pp. 264-323
    • Jain, A.1    Murty, M.2    Flynn, P.3
  • 20
    • 14644416505 scopus 로고    scopus 로고
    • Identifying time-lagged gene clusters using gene expression data
    • Ji L, Tan K (2005) Identifying time-lagged gene clusters using gene expression data. Bioinformatics 21(4): 509-516.
    • (2005) Bioinformatics , vol.21 , Issue.4 , pp. 509-516
    • Ji, L.1    Tan, K.2
  • 23
    • 13844276694 scopus 로고    scopus 로고
    • Cluster analysis for gene expression data: a survey
    • Jiang D, Tang C, Zhang A (2004) Cluster analysis for gene expression data: a survey. IEEE Trans Knowl Data Eng 16(11): 1370-1386.
    • (2004) IEEE Trans Knowl Data Eng , vol.16 , Issue.11 , pp. 1370-1386
    • Jiang, D.1    Tang, C.2    Zhang, A.3
  • 25
    • 79951714186 scopus 로고    scopus 로고
    • RMT assessments of the market latent information embedded in the stocks' raw, normalized and partial correlations
    • Kenett D, Shapira Y, Ben-Jacob E (2009) RMT assessments of the market latent information embedded in the stocks' raw, normalized and partial correlations. J Probab Stat.
    • (2009) J Probab Stat.
    • Kenett, D.1    Shapira, Y.2    Ben-Jacob, E.3
  • 26
    • 0035176032 scopus 로고    scopus 로고
    • Improved inapproximability results for maxclique, chromatic number and approximate graph coloring
    • IEEE
    • Khot S (2002) Improved inapproximability results for maxclique, chromatic number and approximate graph coloring. In: Proceedings of the 42nd IEEE symposium on foundations of computer science. IEEE, pp 600-609.
    • (2002) Proceedings of the 42nd IEEE symposium on foundations of computer science , pp. 600-609
    • Khot, S.1
  • 27
    • 0037399130 scopus 로고    scopus 로고
    • Spectral biclustering of microarray data: coclustering genes and conditions
    • Kluger Y, Basri R, Chang J, Gerstein M (2003) Spectral biclustering of microarray data: coclustering genes and conditions. Genome Res 13(4): 703-716.
    • (2003) Genome Res , vol.13 , Issue.4 , pp. 703-716
    • Kluger, Y.1    Basri, R.2    Chang, J.3    Gerstein, M.4
  • 28
    • 0002514541 scopus 로고
    • Algorithms for constraint-satisfaction problems: a survey
    • Kumar V (1992) Algorithms for constraint-satisfaction problems: a survey. AI Mag 13(1): 32-44.
    • (1992) AI Mag , vol.13 , Issue.1 , pp. 32-44
    • Kumar, V.1
  • 29
    • 33751001062 scopus 로고    scopus 로고
    • Finding biclusters by random projections
    • Lonardi S, Szpankowski W, Yang Q (2006) Finding biclusters by random projections. Theor Comput Sci 368(3): 217-230.
    • (2006) Theor Comput Sci , vol.368 , Issue.3 , pp. 217-230
    • Lonardi, S.1    Szpankowski, W.2    Yang, Q.3
  • 31
    • 3142768191 scopus 로고    scopus 로고
    • Biclustering algorithms for biological data analysis: a survey
    • Madeira S, Oliveira A (2004) Biclustering algorithms for biological data analysis: a survey. IEEE/ACM Trans Comput Biol Bioinform 1(1): 24-45.
    • (2004) IEEE/ACM Trans Comput Biol Bioinform , vol.1 , Issue.1 , pp. 24-45
    • Madeira, S.1    Oliveira, A.2
  • 34
    • 71949123741 scopus 로고    scopus 로고
    • Subspace and projected clustering: experimental evaluation and analysis
    • Moise G, Zimek A, Kroeger P, Kriegel H, Sander J (2009) Subspace and projected clustering: experimental evaluation and analysis. Knowl Inf Syst 21(3): 299-326.
    • (2009) Knowl Inf Syst , vol.21 , Issue.3 , pp. 299-326
    • Moise, G.1    Zimek, A.2    Kroeger, P.3    Kriegel, H.4    Sander, J.5
  • 38
    • 0036649978 scopus 로고    scopus 로고
    • A survey of temporal knowledge discovery paradigms and methods
    • Roddick J, Spiliopoulou M (2002) A survey of temporal knowledge discovery paradigms and methods. IEEE Trans Knowl Data Eng, pp 750-767.
    • (2002) IEEE Trans Knowl Data Eng , pp. 750-767
    • Roddick, J.1    Spiliopoulou, M.2
  • 39
    • 11244306358 scopus 로고    scopus 로고
    • Discovering statistically significant biclusters in gene expression data
    • Tanay A, Sharan R, Shamir R (2002) Discovering statistically significant biclusters in gene expression data. Bioinformatics 1(1): 1-9.
    • (2002) Bioinformatics , vol.1 , Issue.1 , pp. 1-9
    • Tanay, A.1    Sharan, R.2    Shamir, R.3
  • 41
    • 84859900409 scopus 로고    scopus 로고
    • USGS: Real Time Water Information System. National Water Information System
    • USGS: Real Time Water Information System (2010) U. S. Geological Survey, National Water Information System. http://waterdata. usgs. gov/nwis/.
    • (2010) U. S. Geological Survey
  • 43
    • 84859902335 scopus 로고    scopus 로고
    • Wolfram {pipe} Alpha (access Dec 31
    • Wolfram {pipe} Alpha (access Dec 31, 2010) Wolfram Alpha LLC. http://www. wolframalpha. com/.
    • (2010) Wolfram Alpha LLC
  • 44
    • 34447279700 scopus 로고    scopus 로고
    • Identifying regulatory targets of cell cycle transcription factors using gene expression and ChIP-chip data
    • Wu W, Li W, Chen B (2007) Identifying regulatory targets of cell cycle transcription factors using gene expression and ChIP-chip data. BMC Bioinform 8(1): 188.
    • (2007) BMC Bioinform , vol.8 , Issue.1 , pp. 188
    • Wu, W.1    Li, W.2    Chen, B.3
  • 49
    • 38049091170 scopus 로고    scopus 로고
    • Mining time-shifting co-regulation patterns from gene expression data
    • Yin Y, Zhao Y, Zhang B, Wang G (2007) Mining time-shifting co-regulation patterns from gene expression data. Adv Data Web Manage, pp 62-73.
    • (2007) Adv Data Web Manage , pp. 62-73
    • Yin, Y.1    Zhao, Y.2    Zhang, B.3    Wang, G.4
  • 53
    • 43849088675 scopus 로고    scopus 로고
    • Linear degree extractors and the inapproximability of max clique and chromatic number
    • Zuckerman D (2007) Linear degree extractors and the inapproximability of max clique and chromatic number. Theory Comput 3(1): 103-128.
    • (2007) Theory Comput , vol.3 , Issue.1 , pp. 103-128
    • Zuckerman, D.1


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