메뉴 건너뛰기




Volumn , Issue , 2008, Pages 25-33

Structured entity identification and document categorization: Two tasks with one joint model

Author keywords

Document categorization; Entity identification; Probabilistic generative model

Indexed keywords

DOCUMENT CATEGORIZATION; E-M ALGORITHMS; ENTITY IDENTIFICATION; JOINT MODELS; PROBABILISTIC GENERATIVE MODEL; SYNTHETIC DATUM;

EID: 65449128550     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1401890.1401899     Document Type: Conference Paper
Times cited : (16)

References (21)
  • 1
    • 34248229658 scopus 로고    scopus 로고
    • Collective entity resolution in relational data
    • March
    • I. Bhattacharya and L. Getoor. Collective entity resolution in relational data. ACM TKDD, 1(1), March 2007.
    • (2007) ACM TKDD , vol.1 , Issue.1
    • Bhattacharya, I.1    Getoor, L.2
  • 3
    • 0031620208 scopus 로고    scopus 로고
    • Combining labeled and unlabeled data with co-training
    • A. Blum and T. Mitchell. Combining labeled and unlabeled data with co-training. In COLT, 1998.
    • (1998) COLT
    • Blum, A.1    Mitchell, T.2
  • 4
    • 0031189914 scopus 로고    scopus 로고
    • Multitask learning
    • R. Caruana. Multitask learning. Machine Learning, 28(1), 1997.
    • (1997) Machine Learning , vol.28 , Issue.1
    • Caruana, R.1
  • 5
    • 85018100714 scopus 로고    scopus 로고
    • Efficiently linking text documents with relevant structured information
    • V. T. Chakaravarthy, H. Gupta, P. Roy, and M. Mohania. Efficiently linking text documents with relevant structured information. In VLDB, 2006.
    • (2006) VLDB
    • Chakaravarthy, V.T.1    Gupta, H.2    Roy, P.3    Mohania, M.4
  • 6
    • 0035789644 scopus 로고    scopus 로고
    • Co-clustering documents and words using bipartite spectral graph partitioning
    • I. S. Dhillon. Co-clustering documents and words using bipartite spectral graph partitioning. In SIGKDD, 2001.
    • (2001) SIGKDD
    • Dhillon, I.S.1
  • 7
    • 29844452555 scopus 로고    scopus 로고
    • Reference reconciliation in complex information spaces
    • X. Dong, A. Halevy, and J. Madhavan. Reference reconciliation in complex information spaces. In SIGMOD, 2005.
    • (2005) SIGMOD
    • Dong, X.1    Halevy, A.2    Madhavan, J.3
  • 9
    • 84976856849 scopus 로고
    • The merge/purge problem for large databases
    • M. Hernández and S. Stolfo. The merge/purge problem for large databases. In SIGMOD, 1995.
    • (1995) SIGMOD
    • Hernández, M.1    Stolfo, S.2
  • 10
    • 85026972772 scopus 로고    scopus 로고
    • Probabilistic latent semantic indexing
    • T. Hofmanu. Probabilistic latent semantic indexing. In SIGIR, 1999.
    • (1999) SIGIR
    • Hofmanu, T.1
  • 11
    • 0000636553 scopus 로고    scopus 로고
    • Text categorization with support vector machines: Learning with many relevant features
    • T. Joachims. Text categorization with support vector machines: learning with many relevant features. In ECML, 1998.
    • (1998) ECML
    • Joachims, T.1
  • 12
    • 17244368453 scopus 로고    scopus 로고
    • Semantic integration in text: From ambiguous names to identifiable entities
    • X. Li, P. Morie, and D. Roth. Semantic integration in text: from ambiguous names to identifiable entities. AI Mag., 26(1), 2005.
    • (2005) AI Mag , vol.26 , Issue.1
    • Li, X.1    Morie, P.2    Roth, D.3
  • 13
    • 31844455911 scopus 로고    scopus 로고
    • Conditional models of identity uncertainty with application to noun coreference
    • A. McCallum and B. Wellner. Conditional models of identity uncertainty with application to noun coreference. In NIPS, 2004.
    • (2004) NIPS
    • McCallum, A.1    Wellner, B.2
  • 14
    • 0036205389 scopus 로고    scopus 로고
    • R. E. Melnik S., Garcia-Molina H. Similarity flooding: A versatile graph matching algorithm and its application to schema matching. In ICDE, 2002.
    • R. E. Melnik S., Garcia-Molina H. Similarity flooding: A versatile graph matching algorithm and its application to schema matching. In ICDE, 2002.
  • 15
    • 0033886806 scopus 로고    scopus 로고
    • Text classification from labeled and unlabeled documents using em
    • K. Nigam, A. K. McCallum, S. Thrun, and T. Mitchell. Text classification from labeled and unlabeled documents using em. Machine Learning, 39(2-3), 2000.
    • (2000) Machine Learning , vol.39 , Issue.2-3
    • Nigam, K.1    McCallum, A.K.2    Thrun, S.3    Mitchell, T.4
  • 16
    • 0033886806 scopus 로고    scopus 로고
    • Text classification from labeled and unlabeled documents using EM
    • K. Nigam, A. K. McCallum, S. Thrun, and T. M. Mitchell. Text classification from labeled and unlabeled documents using EM. Machine Learning, 39(2/3), 2000.
    • (2000) Machine Learning , vol.39 , Issue.2-3
    • Nigam, K.1    McCallum, A.K.2    Thrun, S.3    Mitchell, T.M.4
  • 17
    • 16244370645 scopus 로고    scopus 로고
    • On matching schemas automatically
    • B. P. A. Rahm Erhard. On matching schemas automatically. In VLDB Journal, volume 10(4), 2001.
    • (2001) VLDB Journal , vol.10 , Issue.4
    • Rahm Erhard, B.P.A.1
  • 19
    • 10644286224 scopus 로고    scopus 로고
    • Cross-training: Exploiting probabilistic mappings between topics
    • S. Sarawagi, S. Chakrabarti, and S. Godbole. Cross-training: Exploiting probabilistic mappings between topics. In SIGKDD, 2003.
    • (2003) SIGKDD
    • Sarawagi, S.1    Chakrabarti, S.2    Godbole, S.3
  • 20
    • 36349034741 scopus 로고    scopus 로고
    • Object identification with attribute-mediated dependences
    • P. Singla and P. Domingos. Object identification with attribute-mediated dependences. In PKDD, 2005.
    • (2005) PKDD
    • Singla, P.1    Domingos, P.2
  • 21
    • 0042496037 scopus 로고    scopus 로고
    • Discovering structure in multiple learning tasks: The tc algorithm
    • S. Thrun and J. O'Sullivan. Discovering structure in multiple learning tasks: The tc algorithm. In ICML, 1996.
    • (1996) ICML
    • Thrun, S.1    O'Sullivan, J.2


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