Filters








21,575 Hits in 3.7 sec

Efficient Attribute Recommendation with Probabilistic Guarantee

Chi Wang, Kaushik Chakrabarti
2018 Proceedings of the 24th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining - KDD '18  
In this paper, we develop an adaptive querying solution with probabilistic guarantee of correctness and near-optimal sample complexity.  ...  We study how to efficiently solve a primitive data exploration problem: Given two ad-hoc predicates which define two subsets of a relational table, find the top-K attributes whose distributions in the  ...  TopKAttr is the first randomized algorithm with provable guarantee for top-K attribute recommendation. Efficiency.  ... 
doi:10.1145/3219819.3219984 dblp:conf/kdd/0001C18 fatcat:wsy7isoqyraj7amvocqblc47y4

Supporting Dynamic, People-Driven Processes through Self-learning of Message Flows [chapter]

Christoph Dorn, Schahram Dustdar
2011 Lecture Notes in Computer Science  
Our probabilistic process engine demonstrates rapid learning of message flow evolution while maintaining the quality of activity recommendations.  ...  We introduce a probabilistic process model and message state model to learn message-activity dependencies, predict message occurrence, and keep the process model in line with real world user behavior.  ...  Fig. 2 . 2 Supporting message prediction and activity recommendation through selflearning message flows Fig. 3 . 3 Flow Model supporting the annotation of transitions with probabilistic message types  ... 
doi:10.1007/978-3-642-21640-4_48 fatcat:g3yvb7fxizaunivufq5ibwpacm

Managing Probabilistic Data with MystiQ: The Can-Do, the Could-Do, and the Can't-Do [chapter]

Christopher Re, Dan Suciu
2008 Lecture Notes in Computer Science  
to queries with self-joins.  ...  For example, our evaluation techniques for queries with a HAVING clause applies only to safe queries; for another example, we currently don't know of a good approach to extend safe queries and safe plans  ...  First, it was developed only for probabilistic tables with independent tuples 4 : there are currently no efficient algorithms known for evaluating queries with selfjoins over disjoint-independent databases  ... 
doi:10.1007/978-3-540-87993-0_3 fatcat:h4xoijkrvjfrlilkbfth5nictm

Privacy-Preserving Social Media Data Publishing for Personalized Ranking-Based Recommendation

Dingqi Yang, Bingqing Qu, Philippe Cudre-Mauroux
2018 IEEE Transactions on Knowledge and Data Engineering  
An empirical evaluation on both synthetic and real-world datasets shows that our framework can efficiently provide effective and continuous protection of user-specified private data, while still preserving  ...  Personalized recommendation is crucial to help users find pertinent information.  ...  Due to the streaming nature of user activity data, the efficiency of probabilistic online data obfuscation is particularly important.  ... 
doi:10.1109/tkde.2018.2840974 fatcat:dn6mu7f4czcghij5i6n4nhhicm

An Accuracy-Assured Privacy-Preserving Recommender System for Internet Commerce [article]

Zhigang Lu, Hong Shen
2015 arXiv   pre-print
Theoretical and experimental analysis show that to provide an accuracy-assured recommendation, our Partitioned Probabilistic Neighbour Selection method yields a better trade-off between the recommendation  ...  In this paper, to overcome the problem of recommendation accuracy loss, we propose a novel approach, Partitioned Probabilistic Neighbour Selection, to ensure a required prediction accuracy while maintaining  ...  So the PNCF method [29] will actually be a method of Global Probabilistic Neighbour Selection [1] and cannot guarantee any recommendation accuracy.  ... 
arXiv:1505.07897v3 fatcat:2zuxixr6zfahnl7uvkm5zharlu

An accuracy-assured privacy-preserving recommender system for internet commerce

Zhigang Lu, Hong Shen
2015 Computer Science and Information Systems  
Theoretical and experimental analysis show that to provide an accuracy-assured recommendation, our Partitioned Probabilistic Neighbour Selection method yields a better trade-off between the recommendation  ...  In this paper, to overcome the problem of recommendation accuracy loss, we propose a novel approach, Partitioned Probabilistic Neighbour Selection, to ensure a required prediction accuracy while maintaining  ...  So the PNCF method [28] will actually be a method of Global Probabilistic Neighbour Selection [1] and cannot guarantee any recommendation accuracy.  ... 
doi:10.2298/csis140725056l fatcat:lrslko2h3fb4jbvaaxcz7q3lze

Optimal Set Recommendations Based on Regret

Paolo Viappiani, Craig Boutilier
2009 International Joint Conference on Artificial Intelligence  
Current conversational recommender systems do not offer guarantees on the quality of their recommendations, either because they do not maintain a model of a user's utility function, or do so in an ad hoc  ...  Thus setwise max regret acts both as guarantee on the quality of our recommendations and as a driver for further utility elicitation.  ...  In Figure 3 we compare the efficiency of an elicitation based on our SMR criterion and the current solution strategy (CSS), considering a syhnthetic dataset with 5000 options and 10 attributes.  ... 
dblp:conf/ijcai/ViappianiB09 fatcat:4f7qfejodvaxhigqfygn22nsae

Auditing Black-Box Prediction Models for Data Minimization Compliance

Bashir Rastegarpanah, Krishna P. Gummadi, Mark Crovella
2021 Neural Information Processing Systems  
We extend the applicability of this metric from a finite sample model to a distributional setting by introducing a probabilistic data minimization guarantee, which we derive using a Bayesian approach.  ...  We define two bandit problems for providing a probabilistic data minimization guarantee at a given confidence level: a decision problem given a data minimization level, and a measurement problem given  ...  Probabilistic data minimization guarantee. In order to design a probabilistic audit mechanism, we first define the probabilistic data minimization guarantee.  ... 
dblp:conf/nips/RastegarpanahGC21 fatcat:yzihwnd2kzc4te357daxxtlgzi

PR-OWL: A Bayesian Ontology Language for the Semantic Web [chapter]

Paulo Cesar G. da Costa, Kathryn B. Laskey, Kenneth J. Laskey
2008 Lecture Notes in Computer Science  
The new language, PR-OWL, will allow legacy ontologies to interoperate with newly developed probabilistic ontologies.  ...  We propose to extend OWL, the ontology language recommended by the World Wide Web Consortium (W3C), to provide the ability to express probabilistic knowledge.  ...  As a consequence, there are no guarantees that exact reasoning with a PR-OWL ontology will be efficient or even decidable.  ... 
doi:10.1007/978-3-540-89765-1_6 fatcat:azbyns4ftfdlvbunfm4kr2mceu

Frequency-hiding Dependency-preserving Encryption for Outsourced Databases [article]

Boxiang Dong, Hui Wendy Wang
2016 arXiv   pre-print
We consider the frequency analysis attack, and show that the F2 encryption scheme can defend against the attack under Kerckhoff's principle with provable guarantee.  ...  Our empirical study demonstrates the efficiency and effectiveness of F2.  ...  The experiment results show that F 2 can encrypt large datasets efficiently with high security guarantee.  ... 
arXiv:1603.00893v2 fatcat:7vhjmznxj5ewlfcszu5kh6wthm

User-driven refinement of imprecise queries

Bahar Qarabaqi, Mirek Riedewald
2014 2014 IEEE 30th International Conference on Data Engineering  
This process is characterized by three key challenges: (1) dealing with incomplete and imprecise user input, (2) keeping user effort low, and (3) guaranteeing interactive system response time.  ...  We address the first two challenges with a probability-based framework that guides the user to the most important query conditions.  ...  Any opinions, findings, and conclusions or recommendations expressed in this material are those of the authors and do not necessarily reflect the views of the sponsors.  ... 
doi:10.1109/icde.2014.6816711 dblp:conf/icde/QarabaqiR14 fatcat:aib56qjdybdobit2uimlamdh5u

User-driven refinement of imprecise queries

Bahar Qarabaqi
2014 2014 IEEE 30th International Conference on Data Engineering Workshops  
This process is characterized by three key challenges: (1) dealing with incomplete and imprecise user input, (2) keeping user effort low, and (3) guaranteeing interactive system response time.  ...  We address the first two challenges with a probability-based framework that guides the user to the most important query conditions.  ...  Any opinions, findings, and conclusions or recommendations expressed in this material are those of the authors and do not necessarily reflect the views of the sponsors.  ... 
doi:10.1109/icdew.2014.6818355 dblp:conf/icde/Qarabaqi14 fatcat:lep5bqdkgvbyznqbqwf7ffd7yi

An Efficient Fuzzy Association Rule Mining Technique
IJARCCE - Computer and Communication Engineering

Gajendra Singh Rajput, Nayna Sharma, Shashank Swami
2015 IJARCCE  
The proposed method which allows considerably reduced the search space with discover the frequent item set and finding fuzzy sets for quantitative attributes in a database and finally employs techniques  ...  In this paper we proposed efficient fuzzy association rule mining technique to find all co-occurrence relationships among data items.  ...  By the A Priori Principle, the best testset is guaranteed to be included among these.  ... 
doi:10.17148/ijarcce.2015.4381 fatcat:aws2f37ho5eylh7wa4jrfxhlji

Robust Optimization of Recommendation Sets with the Maximin Utility Criterion [chapter]

Paolo Viappiani, Christian Kroer
2013 Lecture Notes in Computer Science  
We show how it is possible to efficiently compute the maximin optimal recommendation in face of utility uncertainty, even in large configuration spaces.  ...  We then introduce a new decision criterion, setwise maximin utility (SMMU), for constructing optimal recommendation sets: we develop algorithms for computing SMMU and present experimental results showing  ...  The latter approach provided recommendations with worst-case guarantees; regret measures the worst-case loss in utility the user might incur by accepting a given recommendation instead of the optimal option  ... 
doi:10.1007/978-3-642-41575-3_32 fatcat:nyprjq3fjfavfcgsgkp35yecfq

Database Security and Privacy [chapter]

Sabrina De Capitani, Sara Foresti, Sushil Jajodia, Pierangela Samarati
2014 Computing Handbook, Third Edition  
Probabilistic approaches provide a good trade-off between completeness guarantee and efficiency in query evaluation.  ...  The guarantee of completeness provided by probabilistic approaches increases with the number of additional (fake or duplicated) tuples inserted in the dataset.  ...  Index: Piece of additional information stored at the external server together with relation R that can be used to efficiently evaluate queries operating on the attribute on which the index has been defined  ... 
doi:10.1201/b16768-61 fatcat:2ww5vriigbcavo5uboy3hnztze
« Previous Showing results 1 — 15 out of 21,575 results