메뉴 건너뛰기




Volumn , Issue , 2011, Pages 404-412

Matching unstructured product offers to structured product specifications

Author keywords

Commerce search; Matching; Structured data; Unstructured data

Indexed keywords

ELECTRONIC COMMERCE; SPECIFICATIONS;

EID: 80052681284     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2020408.2020474     Document Type: Conference Paper
Times cited : (72)

References (27)
  • 4
    • 33746054079 scopus 로고    scopus 로고
    • Adaptive product normalization: Using online learning for record linkage in comparison shopping
    • DOI 10.1109/ICDM.2005.18, 1565662, Proceedings - Fifth IEEE International Conference on Data Mining, ICDM 2005
    • M. Bilenko, S. Basu, and M. Sahami. Adaptive product normalization: Using online learning for record linkage in comparison shopping. In ICDM, pages 58-65, 2005. (Pubitemid 47385677)
    • (2005) Proceedings - IEEE International Conference on Data Mining, ICDM , pp. 58-65
    • Bilenko, M.1    Basu, S.2    Sahami, M.3
  • 6
    • 77952372966 scopus 로고    scopus 로고
    • Adaptive duplicate detection using learnable string similarity measures
    • M. Bilenko and R. J. Mooney. Adaptive duplicate detection using learnable string similarity measures. In KDD, pages 39-48, 2003.
    • (2003) KDD , pp. 39-48
    • Bilenko, M.1    Mooney, R.J.2
  • 7
    • 85018100714 scopus 로고    scopus 로고
    • Efficiently linking text documents with relevant structured information
    • V. Chakaravarthy, H. Gupta, P. Roy, and M. Mohania. Efficiently linking text documents with relevant structured information. In VLDB, pages 667-678, 2006.
    • (2006) VLDB , pp. 667-678
    • Chakaravarthy, V.1    Gupta, H.2    Roy, P.3    Mohania, M.4
  • 8
    • 0035452641 scopus 로고    scopus 로고
    • Efficient data reconciliation
    • DOI 10.1016/S0020-0255(00)00070-0, PII S0020025500000700
    • M. Cochinwala, V. Kurien, G. Lalk, and D. Shasha. Efficient data reconciliation. Information Sciences, 137(1-4):1-15, 2001. (Pubitemid 32654934)
    • (2001) Information Sciences , vol.137 , Issue.1-4 , pp. 1-15
    • Cochinwala, M.1    Kurien, V.2    Lalk, G.3    Shasha, D.4
  • 9
    • 0032091575 scopus 로고    scopus 로고
    • Integration of heterogeneous databases without common domains using queries based on textual similarity
    • W. Cohen. Integration of heterogeneous databases without common domains using queries based on textual similarity. In SIGMOD, pages 202-212, 1998.
    • (1998) SIGMOD , pp. 202-212
    • Cohen, W.1
  • 10
    • 80052652937 scopus 로고    scopus 로고
    • Matching reviews to objects using a language model
    • N. Dalvi, R. Kumar, B. Pang, and A. Tomkins. Matching reviews to objects using a language model. In EMNLP, pages 609-618, 2009.
    • (2009) EMNLP , pp. 609-618
    • Dalvi, N.1    Kumar, R.2    Pang, B.3    Tomkins, A.4
  • 11
    • 0008976137 scopus 로고
    • A solution to the problem of linking multivariate documents
    • N. S. D. DuBois. A solution to the problem of linking multivariate documents. Journal of the American Statistical Association, 64(325):163-174, 1969.
    • (1969) Journal of the American Statistical Association , vol.64 , Issue.325 , pp. 163-174
    • DuBois, N.S.D.1
  • 14
    • 80052655005 scopus 로고    scopus 로고
    • State of the U.S. retail economy in Q2 2009
    • August 20
    • G. Fulgoni. State of the U.S. Retail Economy in Q2 2009. Technical report, Comscore, August 20 2009.
    • (2009) Technical Report, Comscore
    • Fulgoni, G.1
  • 15
    • 84976856849 scopus 로고
    • The merge/purge problem for large databases
    • M. A. Herńandez and S. J. Stolfo. The merge/purge problem for large databases. In SIGMOD, pages 127-138, 1995.
    • (1995) SIGMOD , pp. 127-138
    • Herńandez, M.A.1    Stolfo, S.J.2
  • 16
    • 0034592784 scopus 로고    scopus 로고
    • Efficient clustering of high-dimensional data sets with application to reference matching
    • A. Mccallum, K. Nigam, and H. L. Ungar. Efficient clustering of high-dimensional data sets with application to reference matching. In In Knowledge Discovery and Data Mining, pages 169-178, 2000.
    • (2000) Knowledge Discovery and Data Mining , pp. 169-178
    • Mccallum, A.1    Nigam, K.2    Ungar, H.L.3
  • 17
    • 44449107123 scopus 로고    scopus 로고
    • Creating relational data from unstructured and ungrammatical data sources
    • M. Michelson and C. Knoblock. Creating relational data from unstructured and ungrammatical data sources. Journal of Artificial Intelligence Research, 31:543-590, 2008. (Pubitemid 351761996)
    • (2008) Journal of Artificial Intelligence Research , vol.31 , pp. 543-590
    • Michelson, M.1    Knoblock, C.A.2
  • 18
  • 20
    • 0002266113 scopus 로고    scopus 로고
    • The field-matching problem: Algorithm and application
    • A. Monge and C. Elkan. The field-matching problem: algorithm and application. In KDD, 1996.
    • (1996) KDD
    • Monge, A.1    Elkan, C.2
  • 22
    • 70350647552 scopus 로고    scopus 로고
    • Keyword query cleaning
    • K. Q. Pu and X. Yu. Keyword query cleaning. In PVLDB, pages 909-920, 2008.
    • (2008) PVLDB , pp. 909-920
    • Pu, K.Q.1    Yu, X.2
  • 23
    • 26844557708 scopus 로고    scopus 로고
    • A hierarchical graphical model for record linkage
    • P. Ravikumar and W. W. Cohen. A hierarchical graphical model for record linkage. In UAI, 2004.
    • (2004) UAI
    • Ravikumar, P.1    Cohen, W.W.2
  • 24
    • 0242456811 scopus 로고    scopus 로고
    • Interactive deduplication using active learning
    • S. Sarawagi and A. Bhamidipaty. Interactive deduplication using active learning. In KDD, pages 269-278, 2002.
    • (2002) KDD , pp. 269-278
    • Sarawagi, S.1    Bhamidipaty, A.2
  • 25
    • 77954727215 scopus 로고    scopus 로고
    • Structured annotations of web queries
    • N. Sarkas, S. Paparizos, and P. Tsaparas. Structured annotations of web queries. In SIGMOD, pages 771-782, 2010.
    • (2010) SIGMOD , pp. 771-782
    • Sarkas, N.1    Paparizos, S.2    Tsaparas, P.3
  • 26
    • 70349971665 scopus 로고    scopus 로고
    • Bi-directional joint inference for entity resolution and segmentation using imperatively-defined factor graphs
    • S. Singh, K. Schultz, and A. McCallum. Bi-directional joint inference for entity resolution and segmentation using imperatively-defined factor graphs. In ECML-PKDD, pages 414-429, 2009.
    • (2009) ECML-PKDD , pp. 414-429
    • Singh, S.1    Schultz, K.2    McCallum, A.3


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