메뉴 건너뛰기




Volumn , Issue , 2012, Pages 25-32

Feature selection for link prediction

Author keywords

Feature selection; Link prediction

Indexed keywords

ACTIVE SET METHODS; CLASSIFICATION ACCURACY; DATA SETS; DISCRIMINATIVE ABILITY; E-MAIL NETWORKS; FEATURE RANKING; FEATURE SPACE; FEATURE WEIGHTING; GREEDY POLICY; LINK PREDICTION; MACHINE LEARNING TECHNIQUES; MODEL RELATIONSHIPS; NETWORK AREA; QUADRATIC OPTIMIZATION PROBLEMS; REAL NUMBER; TRAINING PROCESS;

EID: 84870416465     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2389686.2389692     Document Type: Conference Paper
Times cited : (15)

References (43)
  • 1
    • 0038718854 scopus 로고    scopus 로고
    • The structure and function of complex networks
    • M. E. J. Newman. The structure and function of complex networks. SIAM Review, 45:167-256, 2003.
    • (2003) SIAM Review , vol.45 , pp. 167-256
    • Newman, M.E.J.1
  • 2
    • 18744398132 scopus 로고    scopus 로고
    • The link prediction problem for social networks
    • D. Liben-Nowell and J. Kleinberg. The link prediction problem for social networks. In CIKM, 2003.
    • (2003) CIKM
    • Liben-Nowell, D.1    Kleinberg, J.2
  • 3
    • 77952646278 scopus 로고    scopus 로고
    • The slashdot zoo: Mining a social network with negative edges
    • J. Kunegis and A. Lommatzsch and C. Bauckhage. The slashdot zoo: mining a social network with negative edges. In WWW, 2009.
    • (2009) WWW
    • Kunegis, J.1    Lommatzsch, A.2    Bauckhage, C.3
  • 4
    • 84976668719 scopus 로고
    • Using collaborative filtering to weave an information tapestry
    • D. Goldberg and D. Nichols and B. M. Oki and D. Terry. Using collaborative filtering to weave an information tapestry. Communication ACM, 35(12):61-70, 1992.
    • (1992) Communication ACM , vol.35 , Issue.12 , pp. 61-70
    • Goldberg, D.1    Nichols, D.2    Oki, B.M.3    Terry, D.4
  • 5
    • 53349117774 scopus 로고    scopus 로고
    • High-quality binary protein interaction map of the yeast interactome network
    • H. Yu and P. Braun et al. High-quality binary protein interaction map of the yeast interactome network. Science, 322(5898):104-110, 2008.
    • (2008) Science , vol.322 , Issue.5898 , pp. 104-110
    • Yu, H.1    Braun, P.2
  • 7
    • 49749117074 scopus 로고    scopus 로고
    • Local probabilistic models for link prediction
    • C. Wang and V. Satuluri and S. Parthasarathy . Local probabilistic models for link prediction. ICDM, 2007.
    • (2007) ICDM
    • Wang, C.1    Satuluri, V.2    Parthasarathy, S.3
  • 9
    • 83055191208 scopus 로고    scopus 로고
    • Temporal link prediction by integrating content and structure information
    • S. Gao and L. Denoyer and P. Gallinari. Temporal link prediction by integrating content and structure information. CIKM, 2011.
    • (2011) CIKM
    • Gao, S.1    Denoyer, L.2    Gallinari, P.3
  • 10
    • 83055161701 scopus 로고    scopus 로고
    • Who will follow you back? Reciprocal relationship prediction
    • J. Hopcroft and T. Lou and J. Tang. Who will follow you back? Reciprocal relationship prediction. CIKM, 2011.
    • (2011) CIKM
    • Hopcroft, J.1    Lou, T.2    Tang, J.3
  • 12
    • 84878035192 scopus 로고    scopus 로고
    • Boosting the feature space: Text classification for unstructured data on the web
    • Y. Song and D. Zhou and J. Huang and I. G. Councill and H. Zha and C. L. Giles. Boosting the feature space: Text classification for unstructured data on the web. In ICDM, 2006.
    • (2006) ICDM
    • Song, Y.1    Zhou, D.2    Huang, J.3    Councill, I.G.4    Zha, H.5    Giles, C.L.6
  • 13
  • 14
    • 83055191316 scopus 로고    scopus 로고
    • Takes: A fast method to select features in the kernel space
    • Y. Xu, F. Shen, W. Ping and J. Zhao. TAKES: A Fast Method to Select Features in the Kernel Space. In CIKM, 2011.
    • (2011) CIKM
    • Xu, Y.1    Shen, F.2    Ping, W.3    Zhao, J.4
  • 16
    • 57349114053 scopus 로고    scopus 로고
    • Asymmetric distance estimation with sketches for similarity search in high-dimensional spaces
    • W. Dong, M. Charikar, and K. Li. Asymmetric distance estimation with sketches for similarity search in high-dimensional spaces. In SIGIR, 2008.
    • (2008) SIGIR
    • Dong, W.1    Charikar, M.2    Li, K.3
  • 17
    • 84890520049 scopus 로고    scopus 로고
    • Use of zero-norm with linear models and kernel methods
    • J. Weston, A. Elisseeff, and B. Scholkopf. Use of zero-norm with linear models and kernel methods. JMLR, 3:1439-1461, 2003.
    • (2003) JMLR , vol.3 , pp. 1439-1461
    • Weston, J.1    Elisseeff, A.2    Scholkopf, B.3
  • 18
    • 18744400819 scopus 로고    scopus 로고
    • Feature selection with conditional mutual information maximin in text categorization
    • G. Wang, F. H. Lochovsky, and Q. Yang. Feature selection with conditional mutual information maximin in text categorization. In CIKM, 2004.
    • (2004) CIKM
    • Wang, G.1    Lochovsky, F.H.2    Yang, Q.3
  • 19
    • 0003141935 scopus 로고    scopus 로고
    • A comparative study on feature selection in text categorization
    • Y. Yang and J. O. Pedersen. A comparative study on feature selection in text categorization. In ICML, 1997.
    • (1997) ICML
    • Yang, Y.1    Pedersen, J.O.2
  • 20
    • 34247622378 scopus 로고    scopus 로고
    • Iterative RELIEF for feature weighting: Algorithms, theories, and applications
    • DOI 10.1109/TPAMI.2007.1093
    • Y. Sun. Iterative relief for feature weighting: algorithms, theories, and applications. TPAMI, 29(6):1035-1051, 2007. (Pubitemid 46667414)
    • (2007) IEEE Transactions on Pattern Analysis and Machine Intelligence , vol.29 , Issue.6 , pp. 1035-1051
    • Sun, Y.1
  • 21
    • 0242625250 scopus 로고    scopus 로고
    • SimRank: A measure of structural-context similarity
    • G. Jeh and J. Widom. SimRank: a measure of structural-context similarity. In SIGKDD, 2002.
    • (2002) SIGKDD
    • Jeh, G.1    Widom, J.2
  • 22
    • 80053438862 scopus 로고    scopus 로고
    • Scaling personalized web search
    • G. Jeh and J. Widom. Scaling personalized web search. In WWW, 2003.
    • (2003) WWW
    • Jeh, G.1    Widom, J.2
  • 23
    • 61349106858 scopus 로고    scopus 로고
    • A family of dissimilarity measures between nodes generalizing both the shortest-path and the commute-time distances
    • L. Yen and M. Saerens and A. Mantrach and M. Shimbo. A family of dissimilarity measures between nodes generalizing both the shortest-path and the commute-time distances. In SIGKDD, 2008.
    • (2008) SIGKDD
    • Yen, L.1    Saerens, M.2    Mantrach, A.3    Shimbo, M.4
  • 26
    • 83055186945 scopus 로고    scopus 로고
    • Link prediction: The power of maximal entropy random walk
    • R.-H. Li and J. X. Yu and J. Liu. Link prediction: the power of maximal entropy random walk. In CIKM, 2011.
    • (2011) CIKM
    • Li, R.-H.1    Yu, J.X.2    Liu, J.3
  • 27
    • 79952402158 scopus 로고    scopus 로고
    • Supervised random walks: Predicting and recommending links in social networks
    • L. Backstrom and J. Leskovec. Supervised random walks: predicting and recommending links in social networks. In the WSDM, 2011.
    • (2011) The WSDM
    • Backstrom, L.1    Leskovec, J.2
  • 28
    • 0035680116 scopus 로고    scopus 로고
    • Rapid object detection using a boosted cascade of simple features
    • P. Viola and M. Jones. Rapid object detection using a boosted cascade of simple features. In CVPR, 2001.
    • (2001) CVPR
    • Viola, P.1    Jones, M.2
  • 30
    • 18744400819 scopus 로고    scopus 로고
    • Selection with conditional mutual information maximin in text categorization
    • Feature
    • G. Wang, F. H. Lochovsky, and Q. Yang. Feature selection with conditional mutual information maximin in text categorization. In CIKM, 2004.
    • (2004) CIKM
    • Wang, G.1    Lochovsky, F.H.2    Yang, Q.3
  • 32
    • 25144492516 scopus 로고    scopus 로고
    • Efficient feature selection via analysis of relevance and redundancy
    • L. Yu and H. Liu. Efficient feature selection via analysis of relevance and redundancy. JMLR, 5:1205-1224, 2004.
    • (2004) JMLR , vol.5 , pp. 1205-1224
    • Yu, L.1    Liu, H.2
  • 35
    • 34547469909 scopus 로고    scopus 로고
    • Valid inequalities for mixed integer linear programs
    • DOI 10.1007/s10107-006-0086-0
    • G. Cornuejols. Valid inequalities for mixed integer linear programs. Mathematical Programming, 112(1):3-44, 2008. (Pubitemid 47167323)
    • (2008) Mathematical Programming , vol.112 , Issue.1 , pp. 3-44
    • Cornuejols, G.1
  • 36
    • 80053436012 scopus 로고    scopus 로고
    • On the margin explanation of boosting algorithms
    • L. Wang and M. Sugiyama and Z. H. Zhou and J. Feng. On the margin explanation of boosting algorithms. In COLT, 2008.
    • (2008) COLT
    • Wang, L.1    Sugiyama, M.2    Zhou, Z.H.3    Feng, J.4
  • 43
    • 30344443646 scopus 로고    scopus 로고
    • Empirical analysis of an evolving social network
    • DOI 10.1126/science.1116869
    • G. Kossinets and D. J. Watts. Empirical Analysis of an Evolving Social Network. Science, 311:88-90, 2006. (Pubitemid 43063064)
    • (2006) Science , vol.311 , Issue.5757 , pp. 88-90
    • Kossinets, G.1    Watts, D.J.2


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