Scribd
Upload
24 views

Secure Mining of Association Rules in Horizontally Distributed Databases

This document contains summaries of three research papers: 1. The first paper proposes a protocol for securely mining association rules in horizontally distributed databases that offers enhanced privacy and is more efficient than existing protocols. 2. The second paper introduces an approach for query-adaptive ranking of images with equal hash codes retrieved from image search, by learning bitwise weights for semantic concept classes. 3. The third paper proposes a novel dynamic personalized recommendation algorithm that utilizes information from both ratings and profile contents to provide high-quality recommendations on sparse data.

Uploaded by

venkatsrmv
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
24 views

Secure Mining of Association Rules in Horizontally Distributed Databases

This document contains summaries of three research papers: 1. The first paper proposes a protocol for securely mining association rules in horizontally distributed databases that offers enhanced privacy and is more efficient than existing protocols. 2. The second paper introduces an approach for query-adaptive ranking of images with equal hash codes retrieved from image search, by learning bitwise weights for semantic concept classes. 3. The third paper proposes a novel dynamic personalized recommendation algorithm that utilizes information from both ratings and profile contents to provide high-quality recommendations on sparse data.

Uploaded by

venkatsrmv
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 3

SECURE MINING OF ASSOCIATION RULES IN HORIZONTALLY DISTRIBUTED DATABASES Abstract We propose a protocol for secure mining of association rules

in horizontally distributed databases. The current leading protocol is that of Kantarcioglu and Clifton . Our protocol, like theirs, is based on the Fast Distributed Mining (FDM) algorithm of Cheung et al. , which is an unsecured distributed version of the Apriori algorithm. The main ingredients in our protocol are two novel secure multi-party algorithms one that computes the union of private subsets that each of the interacting players hold, and another that tests the inclusion of an element held by one player in a subset held by another. Our protocol offers enhanced privacy with respect to the protocol in .In addition, it is simpler and is significantly more efficient in terms of communication rounds, communication cost and computational cost. QUERY-ADAPTIVE IMAGE SEARCH WITH HASH CODES Scalable image search based on visual similarity has been an active topic of research in recent years. State-of-the-art solutions often use hashing methods to embed high-dimensional image features into Hamming space, where search can be performed in real-time based on Hamming distance of compact hash codes. Unlike traditional metrics (e.g., Euclidean) that offer continuous distances, the Hamming distances are discrete integer values. As a consequence, there are often a large number of images sharing equal Hamming distances to a query, which largely hurts search results where fine-grained ranking is very important. This paper introduces an approach that enables query-adaptive ranking of the returned images with equal Hamming distances to the queries. This is achieved by firstly offline learning bitwise weights of the hash codes for a diverse set of predefined semantic concept classes. We formulate the weight learning process as a quadratic programming problem that minimizes intra-class distance while preserving inter-class relationship captured by original raw image features. Query-adaptive weights are then computed online by evaluating the proximity between a query and the semantic concept classes.With the query-adaptive bitwise weights, returned images can be easily ordered by weighted Hamming distance at a finer-grained hash code level rather than the original

Hamming distance level. Experiments on a Flickr image dataset show clear improvements from our proposed approach. DYNAMIC PERSONALIZED RECOMMENDATION ON SPARSE DATA Recommendation techniques are very important in the fields of E-commerce and other web-based services. One of the main difficulties is dynamically providing high-quality recommendation on sparse data. In this paper, a novel dynamic personalized recommendation algorithm is proposed, in which information contained in both ratings and profile contents are utilized by exploring latent relations between ratings, a set of dynamic features are designed to describe user preferences in multiple phases, and finally, a recommendation is made by adaptively weighting the features. Experimental results on public data sets show that the proposed algorithm has satisfying performance. LOCAL DIRECTIONAL NUMBER PATTERN FOR FACE ANALYSIS: FACE AND EXPRESSION RECOGNITION This paper proposes a novel local feature descriptor, local directional number pattern (LDN), for face analysis, i.e., face and expression recognition. LDN encodes the directional information of the face's textures (i.e., the texture's structure) in a compact way, producing a more discriminative code than current methods. We compute the structure of each micro-pattern with the aid of a compass mask that extracts directional information, and we encode such information using the prominent direction indices (directional numbers) and sign-which allows us to distinguish among similar structural patterns that have different intensity transitions. We divide the face into several regions, and extract the distribution of the LDN features from them. Then, we concatenate these features into a feature vector, and we use it as a face descriptor. We perform several experiments in which our descriptor performs consistently under illumination, noise, expression, and time lapse variations. Moreover, we test our descriptor with different masks to analyze its performance in different face analysis tasks.

MINING ORDER-PRESERVING SUBMATRICES FROM DATA WITH REPEATED MEASUREMENTS

Order-preserving submatrices (OPSMs) have been shown useful in capturing concurrent patterns in data when the relative magnitudes of data items are more important than their absolute values. To cope with data noise, repeated experiments are often conducted to collect multiple measurements. We propose and study a more robust version of OPSM, where each data item is represented by a set of values obtained from replicated experiments. We call the new problem OPSM-RM (OPSM with repeated measurements). We define OPSM-RM based on a number of practical requirements. We discuss the computational challenges of OPSM-RM and propose a generic mining algorithm. We further propose a series of techniques to speed up two timedominating components of the algorithm. We clearly show the effectiveness of our methods through a series of experiments conducted on real microarray data.

You might also like