메뉴 건너뛰기




Volumn , Issue , 2010, Pages 471-480

Discovering correlated subspace clusters in 3D continuous-valued data

Author keywords

3D subspace clustering; Financial data mining; Information theory

Indexed keywords

3D DATA; DATA SETS; FINANCIAL DATA MINING; FINANCIAL RATIOS; HIGH DIMENSIONAL DATA; INFORMATION THEORETIC MEASURE; MINING PROCESS; REAL-WORLD; ROBUST ALGORITHM; STATISTICAL TECHNIQUES; SUBSPACE CLUSTERING; SUBSPACE CLUSTERS; SYNTHETIC DATASETS;

EID: 79951729099     PISSN: 15504786     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICDM.2010.19     Document Type: Conference Paper
Times cited : (32)

References (36)
  • 3
    • 65449163900 scopus 로고    scopus 로고
    • Finding non-redundant, statistically significant regions in high dimensional data: A novel approach to projected and subspace clustering
    • G. Moise and J. Sander, "Finding non-redundant, statistically significant regions in high dimensional data: A novel approach to projected and subspace clustering," in KDD, 2008, pp. 533-541.
    • (2008) KDD , pp. 533-541
    • Moise, G.1    Sander, J.2
  • 4
    • 70349958226 scopus 로고    scopus 로고
    • MACs: Multi-attribute co-clusters with high correlation information
    • K. Sim, V. Gopalkrishnan, H. N. Chua, and S.-K. Ng, "MACs: Multi-attribute co-clusters with high correlation information," in ECML/PKDD (2), 2009, pp. 398-413.
    • (2009) ECML/PKDD , vol.2 , pp. 398-413
    • Sim, K.1    Gopalkrishnan, V.2    Chua, H.N.3    Ng, S.-K.4
  • 5
    • 0001473437 scopus 로고
    • On estimation of a probability density function and mode
    • E. Parzen, "On estimation of a probability density function and mode," Ann. Math. Stat., vol. 33, no. 3, pp. 1065-1076, 1962.
    • (1962) Ann. Math. Stat. , vol.33 , Issue.3 , pp. 1065-1076
    • Parzen, E.1
  • 6
    • 0036603854 scopus 로고    scopus 로고
    • On the instantiation of possibility distributions
    • DOI 10.1016/S0165-0114(01)00206-8, PII S0165011401002068
    • R. R. Yager, "On the instantiation of possibility distributions," Fuzzy Sets and Systems, vol. 128, no. 2, pp. 261-266, 2002. (Pubitemid 34524522)
    • (2002) Fuzzy Sets and Systems , vol.128 , Issue.2 , pp. 261-266
    • Yager, R.R.1
  • 8
    • 0036933407 scopus 로고    scopus 로고
    • Input feature selection by mutual information based on parzen window
    • N. Kwak and C.-H. Choi, "Input feature selection by mutual information based on Parzen window," IEEE Trans. Pattern Anal. Mach. Intell., vol. 24, no. 12, pp. 1667-1671, 2002.
    • (2002) IEEE Trans. Pattern Anal. Mach. Intell. , vol.24 , Issue.12 , pp. 1667-1671
    • Kwak, N.1    Choi, C.-H.2
  • 10
    • 0034566393 scopus 로고    scopus 로고
    • Biclustering of expression data
    • Y. Cheng and G. M. Church, "Biclustering of expression data," in ISMB, 2000, pp. 93-103.
    • (2000) ISMB , pp. 93-103
    • Cheng, Y.1    Church, G.M.2
  • 11
    • 0032090765 scopus 로고    scopus 로고
    • Automatic subspace clustering of high dimensional data for data mining applications
    • R. Agrawal, J. Gehrke, D. Gunopulos, and P. Raghavan, "Automatic subspace clustering of high dimensional data for data mining applications," in SIGMOD, 1998, pp. 94-105. (Pubitemid 128655960)
    • (1998) SIGMOD Record , vol.27 , Issue.2 , pp. 94-105
    • Agrawal, R.1    Gehrke, J.2    Gunopulos, D.3    Raghavan, P.4
  • 12
    • 77950250511 scopus 로고    scopus 로고
    • Efficient mining of distance-based subspace clusters
    • G. Liu, K. Sim, J. Li, and L. Wong, "Efficient mining of distance-based subspace clusters," Stat. Anal. Data Min., vol. 2, no. 5-6, pp. 427-444, 2009.
    • (2009) Stat. Anal. Data Min. , vol.2 , Issue.5-6 , pp. 427-444
    • Liu, G.1    Sim, K.2    Li, J.3    Wong, L.4
  • 13
    • 79951742996 scopus 로고    scopus 로고
    • Density-connected subspace clustering for high-dimensional data
    • P. Kröger, H.-P. Kriegel, and K. Kailing, "Density-connected subspace clustering for high-dimensional data," in SDM, 2004, pp. 246-257.
    • (2004) SDM , pp. 246-257
    • Kröger, P.1    Kriegel, H.-P.2    Kailing, K.3
  • 16
    • 67649659857 scopus 로고    scopus 로고
    • Finding time-lagged 3D clusters
    • X. Xu, Y. Lu, K.-L. Tan, and A. K. H. Tung, "Finding time-lagged 3D clusters," in ICDE, 2009, pp. 445-456.
    • (2009) ICDE , pp. 445-456
    • Xu, X.1    Lu, Y.2    Tan, K.-L.3    Tung, A.K.H.4
  • 17
    • 78149244925 scopus 로고    scopus 로고
    • Mining frequent closed cubes in 3D datasets
    • L. Ji, K.-L. Tan, and A. K. H. Tung, "Mining frequent closed cubes in 3D datasets," in VLDB, 2006, pp. 811-822.
    • (2006) VLDB , pp. 811-822
    • Ji, L.1    Tan, K.-L.2    Tung, A.K.H.3
  • 18
    • 52649098497 scopus 로고    scopus 로고
    • Data-peeler: Constraint-based closed pattern mining in n-ary relations
    • L. Cerf, J. Besson, C. Robardet, and J.-F. Boulicaut, "Data-Peeler: Constraint-based closed pattern mining in n-ary relations," in SDM, 2008, pp. 37-48.
    • (2008) SDM , pp. 37-48
    • Cerf, L.1    Besson, J.2    Robardet, C.3    Boulicaut, J.-F.4
  • 19
    • 77952375075 scopus 로고    scopus 로고
    • Information-theoretic co-clustering
    • I. S. Dhillon, S. Mallela, and D. S. Modha, "Information-theoretic co-clustering," in KDD, 2003, pp. 89-98.
    • (2003) KDD , pp. 89-98
    • Dhillon, I.S.1    Mallela, S.2    Modha, D.S.3
  • 20
    • 65149091304 scopus 로고    scopus 로고
    • Simultaneous tensor subspace selection and clustering: The equivalence of high order SVD and k-means clustering
    • H. Huang, C. Ding, D. Luo, and T. Li, "Simultaneous tensor subspace selection and clustering: The equivalence of high order SVD and k-means clustering," in KDD, 2008, pp. 327-335.
    • (2008) KDD , pp. 327-335
    • Huang, H.1    Ding, C.2    Luo, D.3    Li, T.4
  • 24
    • 9444258137 scopus 로고    scopus 로고
    • Analyzing Attribute Dependencies
    • Knowledge Discovery in Databases: PKDD 2003
    • A. Jakulin and I. Bratko, "Analyzing attribute dependencies," in PKDD, 2003, pp. 229-240. (Pubitemid 37231099)
    • (2003) LECTURE NOTES IN COMPUTER SCIENCE , Issue.2838 , pp. 229-240
    • Jakulin, A.1    Bratko, I.2
  • 31
    • 65449186692 scopus 로고    scopus 로고
    • Quantitative evaluation of approximate frequent pattern mining algorithms
    • R. Gupta, G. Fang, B. Field, M. Steinbach, and V. Kumar, "Quantitative evaluation of approximate frequent pattern mining algorithms," in KDD, 2008, pp. 301-309.
    • (2008) KDD , pp. 301-309
    • Gupta, R.1    Fang, G.2    Field, B.3    Steinbach, M.4    Kumar, V.5
  • 33
    • 79951733853 scopus 로고    scopus 로고
    • [Last accessed 2009]
    • "Compustat," http://www.compustat.com [Last accessed 2009].
  • 34
    • 79951731619 scopus 로고    scopus 로고
    • [Last accessed 2009]
    • "Investopedia," http://www.investopedia.com/university/ratios/ [Last accessed 2009].
  • 35
    • 79951763471 scopus 로고    scopus 로고
    • U.S. Securities and Exchange Commission, "Microcap stock: A guide for investors," http://www.sec.gov/investor/pubs/microcapstock.htm, 2009.
    • (2009) Microcap Stock: A Guide for Investors
  • 36
    • 79951764492 scopus 로고
    • A test of ben graham's stock selection criteria
    • H. R. Oppenheimer, "A test of Ben Graham's stock selection criteria," Finan. Anal. J., vol. 40, no. 5, pp. 68-74, 1984.
    • (1984) Finan. Anal. J. , vol.40 , Issue.5 , pp. 68-74
    • Oppenheimer, H.R.1


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