메뉴 건너뛰기




Volumn , Issue , 2011, Pages 805-816

Ranking with uncertain scoring functions: Semantics and sensitivity measures

Author keywords

aggregation; ranking; scoring; top k; uncertainty

Indexed keywords

FUNCTION SEMANTIC; RANKING; RANKING QUERIES; SCORING; SCORING FUNCTIONS; SEMANTIC MEASURES; SENSITIVITY MEASURES; TOP-K; UNCERTAINTY; WEIGHTED SUMMATIONS;

EID: 79959996139     PISSN: 07308078     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1989323.1989408     Document Type: Conference Paper
Times cited : (52)

References (16)
  • 1
    • 34249842390 scopus 로고
    • A pivoting algorithm for convex hulls and vertex enumeration of arrangements and polyhedra
    • D. Avis and K. Fukuda. A pivoting algorithm for convex hulls and vertex enumeration of arrangements and polyhedra. Discrete & Computational Geometry, 8, 1992.
    • (1992) Discrete & Computational Geometry , vol.8
    • Avis, D.1    Fukuda, K.2
  • 6
    • 0012413062 scopus 로고    scopus 로고
    • Combining fuzzy information: An overview
    • R. Fagin. Combining fuzzy information: an overview. SIGMOD Record, 31(2), 2002.
    • (2002) SIGMOD Record , vol.31 , Issue.2
    • Fagin, R.1
  • 7
    • 85012120419 scopus 로고    scopus 로고
    • Supporting top-k join queries in relational databases
    • I. F. Ilyas, W. G. Aref, and A. K. Elmagarmid. Supporting top-k join queries in relational databases. In VLDB, 2003.
    • (2003) VLDB
    • Ilyas, I.F.1    Aref, W.G.2    Elmagarmid, A.K.3
  • 8
    • 55349093583 scopus 로고    scopus 로고
    • A survey of top-k query processing techniques in relational database systems
    • I. F. Ilyas, G. Beskales, and M. A. Soliman. A survey of top-k query processing techniques in relational database systems. ACM Comput. Surv., 40(4), 2008.
    • (2008) ACM Comput. Surv. , vol.40 , Issue.4
    • Ilyas, I.F.1    Beskales, G.2    Soliman, M.A.3
  • 9
    • 70350660784 scopus 로고    scopus 로고
    • Consensus answers for queries over probabilistic databases
    • J. Li and A. Deshpande. Consensus answers for queries over probabilistic databases. In PODS, 2009.
    • (2009) PODS
    • Li, J.1    Deshpande, A.2
  • 10
    • 79952971641 scopus 로고    scopus 로고
    • Ranking continuous probabilistic datasets
    • J. Li and A. Deshpande. Ranking continuous probabilistic datasets. PVLDB, 3(1), 2010.
    • (2010) PVLDB , vol.3 , Issue.1
    • Li, J.1    Deshpande, A.2
  • 12
    • 67649637320 scopus 로고    scopus 로고
    • Ranking with uncertain scores
    • M. A. Soliman and I. F. Ilyas. Ranking with uncertain scores. In ICDE, 2009.
    • (2009) ICDE
    • Soliman, M.A.1    Ilyas, I.F.2
  • 13
    • 77955172859 scopus 로고    scopus 로고
    • Supporting ranking queries on uncertain and incomplete data
    • M. A. Soliman, I. F. Ilyas, and S. Ben-David. Supporting ranking queries on uncertain and incomplete data. VLDB Journal, 19(4), 2010.
    • (2010) VLDB Journal , vol.19 , Issue.4
    • Soliman, M.A.1    Ilyas, I.F.2    Ben-David, S.3
  • 15
    • 0002048952 scopus 로고
    • Transitivity revisited
    • P. van Acker. Transitivity revisited. Ann. Oper. Res., 23(1-4), 1990.
    • (1990) Ann. Oper. Res. , vol.23 , Issue.1-4
    • Van Acker, P.1
  • 16
    • 79959954467 scopus 로고    scopus 로고
    • Enabling ad-hoc ranking for data retrieval
    • H. Yu, S. won Hwang, and K. C.-C. Chang. Enabling ad-hoc ranking for data retrieval. In ICDE, 2005.
    • (2005) ICDE
    • Yu, H.1    Won Hwang, S.2    Chang, K.C.-C.3


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