메뉴 건너뛰기




Volumn , Issue , 2012, Pages 435-443

Aggregating web offers to determine product prices

Author keywords

data aggregation; time series analysis

Indexed keywords

DATA AGGREGATION; PREDICTION ALGORITHMS; PRICE LEVELS; PRICE TRENDS; PROBABILISTIC MODELS; PRODUCT PRICE; ROBUST STATISTICS;

EID: 84866040721     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2339530.2339602     Document Type: Conference Paper
Times cited : (10)

References (27)
  • 10
    • 0034170950 scopus 로고    scopus 로고
    • Variational learning for switching state-space models
    • Z. Gharamani and G. E. Hinton. Variational learning for switching state-space models. Neural Computation, 12(4):963-996, 2000.
    • (2000) Neural Computation , vol.12 , Issue.4 , pp. 963-996
    • Gharamani, Z.1    Hinton, G.E.2
  • 13
    • 0032136153 scopus 로고    scopus 로고
    • CONDENSATION - Conditional density propagation for visual tracking
    • M. Isard and A. Blake. CONDENSATION - conditional density propagation for visual tracking. Int. Journal of Computer Vision, 29(1):5-18, 1998.
    • (1998) Int. Journal of Computer Vision , vol.29 , Issue.1 , pp. 5-18
    • Isard, M.1    Blake, A.2
  • 14
    • 85024429815 scopus 로고
    • A new approach to linear filtering and prediction problems
    • R. E. Kalman. A new approach to linear filtering and prediction problems. Transactions of the ASME-Journal of Basic Engineering, 82(Series D):35-45, 1960.
    • (1960) Transactions of the ASME-Journal of Basic Engineering , vol.82 , Issue.SERIES D , pp. 35-45
    • Kalman, R.E.1
  • 15
    • 0003072903 scopus 로고
    • Stochastic simulation algorithms for dynamic probabilistic networks
    • K. Kanazawa, D. Koller, and S. Russel. Stochastic simulation algorithms for dynamic probabilistic networks. In Proc. UAI, 1995.
    • (1995) Proc. UAI
    • Kanazawa, K.1    Koller, D.2    Russel, S.3
  • 16
    • 80052681284 scopus 로고    scopus 로고
    • Matching unstructured product offers to structured product specifications
    • A. Kannan, I. E. Givoni, R. Agrawal, and A. Fuxman. Matching unstructured product offers to structured product specifications. In Proc. KDD, 2011.
    • (2011) Proc. KDD
    • Kannan, A.1    Givoni, I.E.2    Agrawal, R.3    Fuxman, A.4
  • 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.
    • (2008) Journal of Artificial Intelligence Research , vol.31 , pp. 543-590
    • Michelson, M.1    Knoblock, C.2
  • 20
    • 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
  • 22
    • 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
  • 23
    • 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
  • 27
    • 0344551957 scopus 로고    scopus 로고
    • Segmenting foreground objects from a dynamic textured background via a robust kalman filter
    • J. Zhong and S. Sclaroff. Segmenting foreground objects from a dynamic textured background via a robust kalman filter. In Proc. ICCV, 2003.
    • (2003) Proc. ICCV
    • Zhong, J.1    Sclaroff, S.2


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