Bounds on skyline probability for databases with uncertain preferences
For determining skyline objects for an uncertain database with uncertain preferences, it is necessary to compute the skyline probability of a given object with respect to other objects. The problem boils down to computing the probability of the union of events from the probabilities of all possible...
Gespeichert in:
| Veröffentlicht in: | International journal of approximate reasoning Jg. 80; S. 199 - 213 |
|---|---|
| Hauptverfasser: | , , |
| Format: | Journal Article |
| Sprache: | Englisch |
| Veröffentlicht: |
Elsevier Inc
01.01.2017
|
| Schlagworte: | |
| ISSN: | 0888-613X, 1873-4731 |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| Abstract | For determining skyline objects for an uncertain database with uncertain preferences, it is necessary to compute the skyline probability of a given object with respect to other objects. The problem boils down to computing the probability of the union of events from the probabilities of all possible joint probabilities. Linear Bonferroni bound is concerned with computing the bounds on the probability of the union of events with partial information. We use this technique to estimate the skyline probability of an object and propose a polynomial-time algorithm for computing sharp upper bound. We show that the use of partial information does not affect the quality of solution but helps in improving the efficiency. We formulate the problem as a Linear Programming Problem (LPP) and characterize a set of feasible points that is believed to contain all extreme points of the LPP. The maximization of the objective function over this set of points is equivalent to a bi-polar quadratic optimization problem. We use a spectral relaxation technique to solve the bi-polar quadratic optimization problem. The proposed algorithm is of O(n3) time complexity and is the first ever polynomial-time algorithm to determine skyline probability. We show that the bounds computed by our proposed algorithm determine almost the same set of skyline objects as that with the deterministic algorithm. Experimental results are presented to corroborate this claim.
•In this paper we propose three different bounds on skyline probability.•Computation of skyline points using these bounds is more accurate than the earlier sampling based technique.•Our algorithm determines almost the same set of skyline objects as that with the exact method.•We validate our hypothesis by experiments on real and synthetic datasets. |
|---|---|
| AbstractList | For determining skyline objects for an uncertain database with uncertain preferences, it is necessary to compute the skyline probability of a given object with respect to other objects. The problem boils down to computing the probability of the union of events from the probabilities of all possible joint probabilities. Linear Bonferroni bound is concerned with computing the bounds on the probability of the union of events with partial information. We use this technique to estimate the skyline probability of an object and propose a polynomial-time algorithm for computing sharp upper bound. We show that the use of partial information does not affect the quality of solution but helps in improving the efficiency. We formulate the problem as a Linear Programming Problem (LPP) and characterize a set of feasible points that is believed to contain all extreme points of the LPP. The maximization of the objective function over this set of points is equivalent to a bi-polar quadratic optimization problem. We use a spectral relaxation technique to solve the bi-polar quadratic optimization problem. The proposed algorithm is of time complexity and is the first ever polynomial-time algorithm to determine skyline probability. We show that the bounds computed by our proposed algorithm determine almost the same set of skyline objects as that with the deterministic algorithm. Experimental results are presented to corroborate this claim. For determining skyline objects for an uncertain database with uncertain preferences, it is necessary to compute the skyline probability of a given object with respect to other objects. The problem boils down to computing the probability of the union of events from the probabilities of all possible joint probabilities. Linear Bonferroni bound is concerned with computing the bounds on the probability of the union of events with partial information. We use this technique to estimate the skyline probability of an object and propose a polynomial-time algorithm for computing sharp upper bound. We show that the use of partial information does not affect the quality of solution but helps in improving the efficiency. We formulate the problem as a Linear Programming Problem (LPP) and characterize a set of feasible points that is believed to contain all extreme points of the LPP. The maximization of the objective function over this set of points is equivalent to a bi-polar quadratic optimization problem. We use a spectral relaxation technique to solve the bi-polar quadratic optimization problem. The proposed algorithm is of O(n3) time complexity and is the first ever polynomial-time algorithm to determine skyline probability. We show that the bounds computed by our proposed algorithm determine almost the same set of skyline objects as that with the deterministic algorithm. Experimental results are presented to corroborate this claim. •In this paper we propose three different bounds on skyline probability.•Computation of skyline points using these bounds is more accurate than the earlier sampling based technique.•Our algorithm determines almost the same set of skyline objects as that with the exact method.•We validate our hypothesis by experiments on real and synthetic datasets. |
| Author | Kagita, Venkateswara Rao Pujari, Arun K. Padmanabhan, Vineet |
| Author_xml | – sequence: 1 givenname: Arun K. surname: Pujari fullname: Pujari, Arun K. email: akpcs@uohyd.ernet.in – sequence: 2 givenname: Vineet surname: Padmanabhan fullname: Padmanabhan, Vineet email: vineetcs@uohyd.ernet.in – sequence: 3 givenname: Venkateswara Rao surname: Kagita fullname: Kagita, Venkateswara Rao email: venkateswar.rao.kagita@gmail.com |
| BookMark | eNp9kE1LAzEQhoMo2Fb_gKc9etl10mw3KXjRYlUoeFHwFvIxi6nbRJNU6b83pZ48eJoZeJ9h5hmTYx88EnJBoaFAu6t149YqNtPSNzBvANojMqKCs7rljB6TEQgh6o6y11MyTmkNAB1vxYgsb8PW21QFX6X33eA8Vh8xaKXd4PKu6kOsrMpKq4Sp-nb5rdp6gzEr50sQe4xY5nRGTno1JDz_rRPysrx7XjzUq6f7x8XNqjaMsVzbGZ8it7rls661RuMctTG9Bt4i7aBH3WsE1Nb2jCveo0WgreUGjJjplrIJuTzsLUd-bjFluXHJ4DAoj2GbJBUCgLGOQomKQ9TEkFI5VRqXVXbB56jcICnIvTq5lnt1cq9OwlwWdQWd_kE_otuouPsfuj5AWP7_chhlMm4vx7qIJksb3H_4D6tAjN0 |
| CitedBy_id | crossref_primary_10_1016_j_ijar_2018_12_015 crossref_primary_10_1016_j_patrec_2019_06_002 |
| Cites_doi | 10.1016/j.disc.2006.01.009 10.1016/j.cam.2008.11.012 10.1016/S0012-365X(99)00246-0 10.1016/j.procs.2014.05.140 10.14778/2824032.2824040 10.1016/j.ins.2016.01.016 10.1016/j.ins.2015.06.041 10.1016/j.ins.2014.03.044 10.1007/s11280-014-0292-2 10.1287/opre.36.1.145 10.1016/j.procs.2015.08.310 10.1016/S0012-365X(96)00107-0 10.4064/fm-25-1-379-387 10.1109/TKDE.2011.77 10.1109/TKDE.2011.164 10.1016/j.spl.2012.08.002 10.1214/aoms/1177692387 10.2307/3212139 10.1016/j.cviu.2008.05.010 10.1137/0130031 10.1214/aoms/1177698049 10.1090/S0002-9939-1967-0211424-0 10.1090/S0002-9947-1952-0045327-5 |
| ContentType | Journal Article |
| Copyright | 2016 Elsevier Inc. |
| Copyright_xml | – notice: 2016 Elsevier Inc. |
| DBID | AAYXX CITATION 7SC 8FD JQ2 L7M L~C L~D |
| DOI | 10.1016/j.ijar.2016.09.004 |
| DatabaseName | CrossRef Computer and Information Systems Abstracts Technology Research Database ProQuest Computer Science Collection Advanced Technologies Database with Aerospace Computer and Information Systems Abstracts Academic Computer and Information Systems Abstracts Professional |
| DatabaseTitle | CrossRef Computer and Information Systems Abstracts Technology Research Database Computer and Information Systems Abstracts – Academic Advanced Technologies Database with Aerospace ProQuest Computer Science Collection Computer and Information Systems Abstracts Professional |
| DatabaseTitleList | Computer and Information Systems Abstracts |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Computer Science |
| EISSN | 1873-4731 |
| EndPage | 213 |
| ExternalDocumentID | 10_1016_j_ijar_2016_09_004 S0888613X16301566 |
| GroupedDBID | --K --M .~1 0R~ 1B1 1RT 1~. 1~5 29J 4.4 457 4G. 5GY 5VS 6I. 7-5 71M 8P~ 9JN 9JO AAAKF AACTN AAEDT AAEDW AAFTH AAIAV AAIKJ AAKOC AALRI AAOAW AAQFI AAQXK AARIN AAXUO AAYFN ABAOU ABBOA ABFNM ABJNI ABMAC ABUCO ABVKL ABXDB ABYKQ ACAZW ACDAQ ACGFS ACNCT ACNNM ACRLP ACZNC ADBBV ADEZE ADMUD ADTZH AEBSH AECPX AEKER AENEX AEXQZ AFKWA AFTJW AGHFR AGUBO AGYEJ AHHHB AHJVU AHZHX AIALX AIEXJ AIGVJ AIKHN AITUG AJBFU AJOXV ALMA_UNASSIGNED_HOLDINGS AMFUW AMRAJ AOUOD APLSM ARUGR ASPBG AVWKF AXJTR AZFZN BJAXD BKOJK BLXMC CS3 EBS EFJIC EFLBG EJD EO8 EO9 EP2 EP3 F5P FDB FEDTE FGOYB FIRID FNPLU FYGXN GBLVA GBOLZ HAMUX HVGLF HZ~ IHE IXB J1W JJJVA KOM LG9 LY1 M41 MHUIS MO0 N9A NCXOZ O-L O9- OAUVE OK1 OZT P-8 P-9 P2P PC. Q38 R2- RIG ROL RPZ SDF SDG SES SEW SPC SPCBC SSB SSD SST SSV SSW SSZ T5K UHS WUQ XPP ~G- 9DU AATTM AAXKI AAYWO AAYXX ABWVN ACLOT ACRPL ACVFH ADCNI ADNMO ADVLN AEIPS AEUPX AFJKZ AFPUW AGQPQ AIGII AIIUN AKBMS AKRWK AKYEP ANKPU APXCP CITATION EFKBS ~HD 7SC 8FD JQ2 L7M L~C L~D |
| ID | FETCH-LOGICAL-c333t-d572e7db47564dcbe9ebccfb074e160febfbe0ebddf37a7fede014d7c0c85b413 |
| ISICitedReferencesCount | 4 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000391080100012&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| ISSN | 0888-613X |
| IngestDate | Sun Sep 28 01:08:57 EDT 2025 Sat Nov 29 04:42:30 EST 2025 Tue Nov 18 22:38:10 EST 2025 Fri Feb 23 02:17:41 EST 2024 |
| IsPeerReviewed | true |
| IsScholarly | true |
| Keywords | Skyline probability Bounds Uncertain preferences |
| Language | English |
| LinkModel | OpenURL |
| MergedId | FETCHMERGED-LOGICAL-c333t-d572e7db47564dcbe9ebccfb074e160febfbe0ebddf37a7fede014d7c0c85b413 |
| Notes | ObjectType-Article-1 SourceType-Scholarly Journals-1 ObjectType-Feature-2 content type line 23 |
| PQID | 1880033610 |
| PQPubID | 23500 |
| PageCount | 15 |
| ParticipantIDs | proquest_miscellaneous_1880033610 crossref_citationtrail_10_1016_j_ijar_2016_09_004 crossref_primary_10_1016_j_ijar_2016_09_004 elsevier_sciencedirect_doi_10_1016_j_ijar_2016_09_004 |
| PublicationCentury | 2000 |
| PublicationDate | January 2017 2017-01-00 20170101 |
| PublicationDateYYYYMMDD | 2017-01-01 |
| PublicationDate_xml | – month: 01 year: 2017 text: January 2017 |
| PublicationDecade | 2010 |
| PublicationTitle | International journal of approximate reasoning |
| PublicationYear | 2017 |
| Publisher | Elsevier Inc |
| Publisher_xml | – name: Elsevier Inc |
| References | Pei, Jiang, Lin, Yuan (br0030) 2007 Park, Min, Shim (br0080) 2015; 8 Hoppe (br0200) 2006; 306 Renyi (br0300) 1970 Courrieu (br0330) 2005; 8 Thompson, Callan (br0010) 2004 Saad, Ibrahim, Alwan, Sidi, Yaakob (br0070) 2014; 29 Frolov (br0190) 2012; 82 Pujari, Kagita, Garg, Padmanabhan (br0140) 2015; vol. 8959 Yong, Lee, Kim, Hwang (br0060) 2014; 273 Kuai, Alajaji, Takahara (br0220) 2000; 215 Chung, Erdos (br0240) 1952; 72 Pujari (br0360) 1979 Olsson, Eriksson, Kahl (br0320) 2008; 112 Le, Cao, He (br0110) 2016; 340 Sobel, Uppuluri (br0230) 1972; 43 Ding, Jin (br0050) 2012; 24 Olsson, Eriksson, Kahl (br0310) 2007 Pan, Chen (br0350) 1999 Galambos, Simonelli (br0260) 1996 Kounias, Marin (br0280) 1976; 30 Liu, Tang (br0090) 2015; 63 Zhang, Ye, Lin, Zhang (br0130) 2013 Frechet (br0250) 1935; 25 Kounias (br0210) 1968; 39 Gallot (br0270) 1966; 3 Prepoka (br0290) 1988; 36 Sacharidis, Arvanitis, Sellis (br0120) 2010 Pujari, Kagita, Garg, Padmanabhan (br0150) 2015; 324 de Caen (br0180) 1997; 169 Morgens, Jhala (br0020) 2013 Kagita, Pujari, Padmanabhan, Kumar, Sahu (br0160) 2016 Kim, Im, Park (br0040) 2012; 24 Petkovic, Stanimirovic (br0340) 2009; 230 Zhang, Li, Cheema, Zhang, Chang (br0100) 2015; 18 Dawson, Sankoff (br0170) 1967; 18 Pan (10.1016/j.ijar.2016.09.004_br0350) 1999 Thompson (10.1016/j.ijar.2016.09.004_br0010) 2004 Pujari (10.1016/j.ijar.2016.09.004_br0140) 2015; vol. 8959 Prepoka (10.1016/j.ijar.2016.09.004_br0290) 1988; 36 Pujari (10.1016/j.ijar.2016.09.004_br0360) 1979 Morgens (10.1016/j.ijar.2016.09.004_br0020) 2013 Chung (10.1016/j.ijar.2016.09.004_br0240) 1952; 72 Courrieu (10.1016/j.ijar.2016.09.004_br0330) 2005; 8 Kagita (10.1016/j.ijar.2016.09.004_br0160) 2016 Sacharidis (10.1016/j.ijar.2016.09.004_br0120) 2010 Kim (10.1016/j.ijar.2016.09.004_br0040) 2012; 24 Galambos (10.1016/j.ijar.2016.09.004_br0260) 1996 Park (10.1016/j.ijar.2016.09.004_br0080) 2015; 8 Dawson (10.1016/j.ijar.2016.09.004_br0170) 1967; 18 Le (10.1016/j.ijar.2016.09.004_br0110) 2016; 340 Hoppe (10.1016/j.ijar.2016.09.004_br0200) 2006; 306 Kuai (10.1016/j.ijar.2016.09.004_br0220) 2000; 215 Kounias (10.1016/j.ijar.2016.09.004_br0280) 1976; 30 Renyi (10.1016/j.ijar.2016.09.004_br0300) 1970 Frechet (10.1016/j.ijar.2016.09.004_br0250) 1935; 25 Gallot (10.1016/j.ijar.2016.09.004_br0270) 1966; 3 Saad (10.1016/j.ijar.2016.09.004_br0070) 2014; 29 Kounias (10.1016/j.ijar.2016.09.004_br0210) 1968; 39 Pei (10.1016/j.ijar.2016.09.004_br0030) 2007 Olsson (10.1016/j.ijar.2016.09.004_br0320) 2008; 112 Liu (10.1016/j.ijar.2016.09.004_br0090) 2015; 63 Zhang (10.1016/j.ijar.2016.09.004_br0130) 2013 Frolov (10.1016/j.ijar.2016.09.004_br0190) 2012; 82 Olsson (10.1016/j.ijar.2016.09.004_br0310) 2007 Petkovic (10.1016/j.ijar.2016.09.004_br0340) 2009; 230 Ding (10.1016/j.ijar.2016.09.004_br0050) 2012; 24 Zhang (10.1016/j.ijar.2016.09.004_br0100) 2015; 18 Pujari (10.1016/j.ijar.2016.09.004_br0150) 2015; 324 de Caen (10.1016/j.ijar.2016.09.004_br0180) 1997; 169 Yong (10.1016/j.ijar.2016.09.004_br0060) 2014; 273 Sobel (10.1016/j.ijar.2016.09.004_br0230) 1972; 43 |
| References_xml | – volume: 24 start-page: 1448 year: 2012 end-page: 1462 ident: br0050 article-title: Efficient and progressive algorithms for distributed skyline queries over uncertain data publication-title: IEEE Trans. Knowl. Data Eng. – volume: 63 start-page: 40 year: 2015 end-page: 47 ident: br0090 article-title: An effective probabilistic skyline query process on uncertain data streams publication-title: Proc. Comput. Sci. – volume: 340 start-page: 58 year: 2016 end-page: 85 ident: br0110 article-title: Answering skyline queries on probabilistic data using the dominance of probabilistic skyline tuples publication-title: Inf. Sci. – start-page: 273 year: 2010 end-page: 284 ident: br0120 article-title: Probabilistic contextual skylines publication-title: ICDE – volume: 112 start-page: 3 year: 2008 end-page: 13 ident: br0320 article-title: Improved spectral relaxation methods for binary quadratic optimization problems publication-title: Comput. Vis. Image Underst. – volume: 18 start-page: 1331 year: 2015 end-page: 1350 ident: br0100 article-title: Probabilistic publication-title: World Wide Web – volume: 8 start-page: 1406 year: 2015 end-page: 1417 ident: br0080 article-title: Processing of probabilistic skyline queries using mapreduce publication-title: Proc. VLDB Endow. – start-page: 395 year: 2013 end-page: 405 ident: br0130 article-title: Skyline probability over uncertain preferences publication-title: EDBT/ICDT – volume: 43 start-page: 1549 year: 1972 end-page: 1558 ident: br0230 article-title: On Bonferroni-type inequalities of the same degree for the probability of unions and intersections publication-title: Ann. Math. Stat. – start-page: 193 year: 2004 end-page: 200 ident: br0010 article-title: A language modeling approach to predicting reading difficulty publication-title: HLT-NAACL – start-page: 83 year: 2013 end-page: 85 ident: br0020 article-title: Synthetic photographs for learning aesthetic preferences publication-title: Late-Breaking Developments in the Field of Artificial Intelligence – volume: vol. 8959 start-page: 250 year: 2015 end-page: 261 ident: br0140 article-title: Bi-directional search for skyline probability publication-title: Algorithms and Discrete Applied Mathematics—CALDAM 2015 – start-page: 507 year: 1999 end-page: 516 ident: br0350 article-title: The complexity of the matrix eigenproblem publication-title: Proceedings of the Thirty-First Annual ACM Symposium on Theory of Computing – volume: 306 start-page: 526 year: 2006 end-page: 530 ident: br0200 article-title: Improving probability bounds by optimization over subsets publication-title: Discrete Math. – volume: 215 start-page: 147 year: 2000 end-page: 158 ident: br0220 article-title: A lower bound on the probability of a finite union of events publication-title: Discrete Math. – year: 1996 ident: br0260 article-title: Bonferroni Type Inequalities with Applications – volume: 25 start-page: 379 year: 1935 end-page: 387 ident: br0250 article-title: Generalisation du theoreme des probabilites totales publication-title: Fundam. Math. – volume: 324 start-page: 146 year: 2015 end-page: 162 ident: br0150 article-title: Efficient computation for probabilistic skyline over uncertain preferences publication-title: Inf. Sci. – volume: 72 start-page: 179 year: 1952 end-page: 186 ident: br0240 article-title: On the application of the Borel–Cantelli lemma publication-title: Trans. Am. Math. Soc. – volume: 39 start-page: 2154 year: 1968 end-page: 2158 ident: br0210 article-title: Bounds for the probability of a union with applications publication-title: Ann. Math. Stat. – start-page: 1 year: 2007 end-page: 8 ident: br0310 article-title: Solving large scale binary quadratic problems: spectral methods vs. semidefinite programming publication-title: Computer Vision and Pattern Recognition – start-page: 15 year: 2007 end-page: 26 ident: br0030 article-title: Probabilistic skylines on uncertain data publication-title: VLDB – volume: 82 start-page: 2189 year: 2012 end-page: 2197 ident: br0190 article-title: Bounds for probabilities of unions of events and the Borel–Cantelli lemma publication-title: Stat. Probab. Lett. – volume: 230 start-page: 270 year: 2009 end-page: 282 ident: br0340 article-title: Generalised inversion is not harder than matrix multiplication publication-title: J. Comput. Appl. Math. – year: 1970 ident: br0300 article-title: Foundations of Probability – volume: 8 start-page: 25 year: 2005 end-page: 29 ident: br0330 article-title: Fast computation of Moore–Penrose inverse matrices publication-title: Neural Inf. Process. – Lett. Rev. – year: 1979 ident: br0360 article-title: Best linear Bonferroni bounds and related polyhedron – volume: 169 start-page: 217 year: 1997 end-page: 220 ident: br0180 article-title: A lower bound on the probability of a union publication-title: Discrete Math. – volume: 29 start-page: 1546 year: 2014 end-page: 1556 ident: br0070 article-title: A framework for evaluating skyline query over uncertain autonomous databases publication-title: Proc. Comput. Sci. – volume: 3 start-page: 556 year: 1966 end-page: 558 ident: br0270 article-title: A bound for the maximum of a number of random variables publication-title: J. Appl. Probab. – volume: 18 start-page: 504 year: 1967 end-page: 507 ident: br0170 article-title: An inequality for probabilities publication-title: Proc. Am. Math. Soc. – volume: 36 start-page: 145 year: 1988 end-page: 162 ident: br0290 article-title: Boole–Bonferroni inequalities and linear programming publication-title: Oper. Res. – volume: 273 start-page: 247 year: 2014 end-page: 262 ident: br0060 article-title: Skyline ranking for uncertain databases publication-title: Inf. Sci. – start-page: 193 year: 2016 end-page: 205 ident: br0160 article-title: Threshold-based direct computation of skyline objects for database with uncertain preferences publication-title: Pacific Rim International Conference on Artificial Intelligence – volume: 30 start-page: 307 year: 1976 end-page: 323 ident: br0280 article-title: Best linear Bonferroni bounds publication-title: SIAM J. Appl. Math. – volume: 24 start-page: 2113 year: 2012 end-page: 2126 ident: br0040 article-title: Computing exact skyline probabilities for uncertain databases publication-title: IEEE Trans. Knowl. Data Eng. – start-page: 83 year: 2013 ident: 10.1016/j.ijar.2016.09.004_br0020 article-title: Synthetic photographs for learning aesthetic preferences – volume: 306 start-page: 526 issue: 5 year: 2006 ident: 10.1016/j.ijar.2016.09.004_br0200 article-title: Improving probability bounds by optimization over subsets publication-title: Discrete Math. doi: 10.1016/j.disc.2006.01.009 – volume: 230 start-page: 270 issue: 1 year: 2009 ident: 10.1016/j.ijar.2016.09.004_br0340 article-title: Generalised inversion is not harder than matrix multiplication publication-title: J. Comput. Appl. Math. doi: 10.1016/j.cam.2008.11.012 – volume: 215 start-page: 147 year: 2000 ident: 10.1016/j.ijar.2016.09.004_br0220 article-title: A lower bound on the probability of a finite union of events publication-title: Discrete Math. doi: 10.1016/S0012-365X(99)00246-0 – volume: 29 start-page: 1546 year: 2014 ident: 10.1016/j.ijar.2016.09.004_br0070 article-title: A framework for evaluating skyline query over uncertain autonomous databases publication-title: Proc. Comput. Sci. doi: 10.1016/j.procs.2014.05.140 – volume: 8 start-page: 1406 issue: 12 year: 2015 ident: 10.1016/j.ijar.2016.09.004_br0080 article-title: Processing of probabilistic skyline queries using mapreduce publication-title: Proc. VLDB Endow. doi: 10.14778/2824032.2824040 – volume: 340 start-page: 58 year: 2016 ident: 10.1016/j.ijar.2016.09.004_br0110 article-title: Answering skyline queries on probabilistic data using the dominance of probabilistic skyline tuples publication-title: Inf. Sci. doi: 10.1016/j.ins.2016.01.016 – volume: 324 start-page: 146 year: 2015 ident: 10.1016/j.ijar.2016.09.004_br0150 article-title: Efficient computation for probabilistic skyline over uncertain preferences publication-title: Inf. Sci. doi: 10.1016/j.ins.2015.06.041 – volume: 8 start-page: 25 issue: 2 year: 2005 ident: 10.1016/j.ijar.2016.09.004_br0330 article-title: Fast computation of Moore–Penrose inverse matrices publication-title: Neural Inf. Process. – Lett. Rev. – volume: 273 start-page: 247 year: 2014 ident: 10.1016/j.ijar.2016.09.004_br0060 article-title: Skyline ranking for uncertain databases publication-title: Inf. Sci. doi: 10.1016/j.ins.2014.03.044 – start-page: 273 year: 2010 ident: 10.1016/j.ijar.2016.09.004_br0120 article-title: Probabilistic contextual skylines – volume: 18 start-page: 1331 issue: 5 year: 2015 ident: 10.1016/j.ijar.2016.09.004_br0100 article-title: Probabilistic n-of-n skyline computation over uncertain data streams publication-title: World Wide Web doi: 10.1007/s11280-014-0292-2 – volume: 36 start-page: 145 issue: 1 year: 1988 ident: 10.1016/j.ijar.2016.09.004_br0290 article-title: Boole–Bonferroni inequalities and linear programming publication-title: Oper. Res. doi: 10.1287/opre.36.1.145 – volume: 63 start-page: 40 year: 2015 ident: 10.1016/j.ijar.2016.09.004_br0090 article-title: An effective probabilistic skyline query process on uncertain data streams publication-title: Proc. Comput. Sci. doi: 10.1016/j.procs.2015.08.310 – start-page: 395 year: 2013 ident: 10.1016/j.ijar.2016.09.004_br0130 article-title: Skyline probability over uncertain preferences – year: 1970 ident: 10.1016/j.ijar.2016.09.004_br0300 – volume: 169 start-page: 217 issue: 1–3 year: 1997 ident: 10.1016/j.ijar.2016.09.004_br0180 article-title: A lower bound on the probability of a union publication-title: Discrete Math. doi: 10.1016/S0012-365X(96)00107-0 – volume: 25 start-page: 379 issue: 1 year: 1935 ident: 10.1016/j.ijar.2016.09.004_br0250 article-title: Generalisation du theoreme des probabilites totales publication-title: Fundam. Math. doi: 10.4064/fm-25-1-379-387 – volume: 24 start-page: 1448 issue: 8 year: 2012 ident: 10.1016/j.ijar.2016.09.004_br0050 article-title: Efficient and progressive algorithms for distributed skyline queries over uncertain data publication-title: IEEE Trans. Knowl. Data Eng. doi: 10.1109/TKDE.2011.77 – start-page: 15 year: 2007 ident: 10.1016/j.ijar.2016.09.004_br0030 article-title: Probabilistic skylines on uncertain data – volume: 24 start-page: 2113 issue: 12 year: 2012 ident: 10.1016/j.ijar.2016.09.004_br0040 article-title: Computing exact skyline probabilities for uncertain databases publication-title: IEEE Trans. Knowl. Data Eng. doi: 10.1109/TKDE.2011.164 – start-page: 507 year: 1999 ident: 10.1016/j.ijar.2016.09.004_br0350 article-title: The complexity of the matrix eigenproblem – start-page: 193 year: 2004 ident: 10.1016/j.ijar.2016.09.004_br0010 article-title: A language modeling approach to predicting reading difficulty – volume: 82 start-page: 2189 issue: 12 year: 2012 ident: 10.1016/j.ijar.2016.09.004_br0190 article-title: Bounds for probabilities of unions of events and the Borel–Cantelli lemma publication-title: Stat. Probab. Lett. doi: 10.1016/j.spl.2012.08.002 – volume: 43 start-page: 1549 issue: 5 year: 1972 ident: 10.1016/j.ijar.2016.09.004_br0230 article-title: On Bonferroni-type inequalities of the same degree for the probability of unions and intersections publication-title: Ann. Math. Stat. doi: 10.1214/aoms/1177692387 – year: 1979 ident: 10.1016/j.ijar.2016.09.004_br0360 – volume: 3 start-page: 556 issue: 2 year: 1966 ident: 10.1016/j.ijar.2016.09.004_br0270 article-title: A bound for the maximum of a number of random variables publication-title: J. Appl. Probab. doi: 10.2307/3212139 – year: 1996 ident: 10.1016/j.ijar.2016.09.004_br0260 – volume: 112 start-page: 3 issue: 1 year: 2008 ident: 10.1016/j.ijar.2016.09.004_br0320 article-title: Improved spectral relaxation methods for binary quadratic optimization problems publication-title: Comput. Vis. Image Underst. doi: 10.1016/j.cviu.2008.05.010 – volume: vol. 8959 start-page: 250 year: 2015 ident: 10.1016/j.ijar.2016.09.004_br0140 article-title: Bi-directional search for skyline probability – volume: 30 start-page: 307 issue: 2 year: 1976 ident: 10.1016/j.ijar.2016.09.004_br0280 article-title: Best linear Bonferroni bounds publication-title: SIAM J. Appl. Math. doi: 10.1137/0130031 – start-page: 1 year: 2007 ident: 10.1016/j.ijar.2016.09.004_br0310 article-title: Solving large scale binary quadratic problems: spectral methods vs. semidefinite programming – volume: 39 start-page: 2154 issue: 6 year: 1968 ident: 10.1016/j.ijar.2016.09.004_br0210 article-title: Bounds for the probability of a union with applications publication-title: Ann. Math. Stat. doi: 10.1214/aoms/1177698049 – start-page: 193 year: 2016 ident: 10.1016/j.ijar.2016.09.004_br0160 article-title: Threshold-based direct computation of skyline objects for database with uncertain preferences – volume: 18 start-page: 504 issue: 3 year: 1967 ident: 10.1016/j.ijar.2016.09.004_br0170 article-title: An inequality for probabilities publication-title: Proc. Am. Math. Soc. doi: 10.1090/S0002-9939-1967-0211424-0 – volume: 72 start-page: 179 issue: 1 year: 1952 ident: 10.1016/j.ijar.2016.09.004_br0240 article-title: On the application of the Borel–Cantelli lemma publication-title: Trans. Am. Math. Soc. doi: 10.1090/S0002-9947-1952-0045327-5 |
| SSID | ssj0006748 |
| Score | 2.1633158 |
| Snippet | For determining skyline objects for an uncertain database with uncertain preferences, it is necessary to compute the skyline probability of a given object with... |
| SourceID | proquest crossref elsevier |
| SourceType | Aggregation Database Enrichment Source Index Database Publisher |
| StartPage | 199 |
| SubjectTerms | Algorithms Bounds Computation Computing time Mathematical models Maximization Optimization Skyline probability Uncertain preferences Unions |
| Title | Bounds on skyline probability for databases with uncertain preferences |
| URI | https://dx.doi.org/10.1016/j.ijar.2016.09.004 https://www.proquest.com/docview/1880033610 |
| Volume | 80 |
| WOSCitedRecordID | wos000391080100012&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| journalDatabaseRights | – providerCode: PRVESC databaseName: Elsevier SD Freedom Collection Journals 2021 customDbUrl: eissn: 1873-4731 dateEnd: 20180131 omitProxy: false ssIdentifier: ssj0006748 issn: 0888-613X databaseCode: AIEXJ dateStart: 19950101 isFulltext: true titleUrlDefault: https://www.sciencedirect.com providerName: Elsevier |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwtV3db9MwELeqjgde-EaMLxmJt6pTPuo6eSxoEzA0ITSmvlk-x4F2Uzo17Sgv_O3c2U6WFW1iD7xEVdRYTu58vjv_7n6MvYW8EGjkymGsDQYoicA1R8C1VAqTprJMhHWsJZ_l0VE2neZfer3fTS3MxZmsqmyzyc__q6jxHgqbSmdvIe52ULyBv1HoeEWx4_WfBP-OiJLcIUB9-ss5kUQa49txe3QmoUJp9wqVbbizeVwANQwI5X9112m9mjXs9JpwDck3M3R6iXxF1y612xrb9Vz7MvbJcl0NDvcuT6sKwszCD597PaF-iC345lB_n3mH9sRWp-QI_9RLPfiqF938RCw7-YnGjGUYoDrW39bmevamYDRjT5EU9t_E16b-Zdp9lmG-N8PJEyRv7PrTeu7iq320t_a3FnXYANrmisZQNIaKcuXaye4kUuRZn-1MPu5PP7V7OVGx-DjEv0Mou_IIwe2ZXOfabG3yznM5fsDuhZCDT7yqPGQ9Wz1i9xs6Dx6s-2N24DWHLyoeNId3NIej5vBWczhpDm81h3c05wn7drB__P7DMNBsDHE1pqthIWRiZQEjKcajwoDNLRhTAjqXNh5HpYUSbGShKMpUalnawmJcXUgTmUwAOkFPWb9aVPYZ40ZCDLGQAASchDEA6DgbCWlHaQaZ2GVx84WUCT3oiQrlTF0vm102aJ859x1Ybvy3aD68Cj6k9w0V6tGNz71ppKTQwNKpma7sYl0ralgYpSmGGc9vNZMX7O7lcnjJ-qvl2r5id8zFalYvXwdF-wNJlKPX |
| linkProvider | Elsevier |
| openUrl | ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=Bounds+on+skyline+probability+for+databases+with+uncertain+preferences&rft.jtitle=International+journal+of+approximate+reasoning&rft.au=Pujari%2C+Arun+K.&rft.au=Padmanabhan%2C+Vineet&rft.au=Kagita%2C+Venkateswara+Rao&rft.date=2017-01-01&rft.issn=0888-613X&rft.volume=80&rft.spage=199&rft.epage=213&rft_id=info:doi/10.1016%2Fj.ijar.2016.09.004&rft.externalDBID=n%2Fa&rft.externalDocID=10_1016_j_ijar_2016_09_004 |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0888-613X&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0888-613X&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0888-613X&client=summon |