Learn More
Keywords: Interesting pattern discovery Interestingness measure Cosine similarity FP-tree Apriori a b s t r a c t This paper presents an efficient algorithm called CosMiner t for interesting pattern discovery. The widely used cosine similarity, found to possess the null-invariance property and the anti-cross-support-pattern property, is adopted as the(More)
Shilling attackers apply biased rating profiles to recommender systems for manipulating online product recommendations. Although many studies have been devoted to shilling attack detection, few of them can handle the <i>hybrid</i> shilling attacks that usually happen in practice, and the studies for real-life applications are rarely seen. Moreover, little(More)
Web service recommendation has become a hot yet fundamental research topic in service computing. The most popular technique is the Collaborative Filtering (CF) based on a user-item matrix. However, it cannot well capture the relationship between Web services and providers. To address this issue, we first design a cube model to explicitly describe the(More)
Information-theoretic clustering aims to exploit information-theoretic measures as the clustering criteria. A common practice on this topic is the so-called Info-Kmeans, which performs K-means clustering with KL-divergence as the proximity function. While expert efforts on Info-Kmeans have shown promising results, a remaining challenge is to deal with(More)
This paper presents an efficient and robust content-based large medical image retrieval method in mobile Cloud computing environment, called the MIRC. The whole query process of the MIRC is composed of three steps. First, when a clinical user submits a query image I q , a parallel image set reduction process is conducted at a master node. Then the candidate(More)
Keywords: Information-theoretic clustering K-means KL-divergence Variable Neighborhood Search (VNS) a b s t r a c t Information-theoretic K-means (Info-Kmeans) aims to cluster high-dimensional data, such as images featured by the bag-of-features (BOF) model, using K-means algorithm with KL-divergence as the distance. While research efforts along this line(More)
A multitude of applications require simultaneous access to multiple kinds of resources scatted in distributed sites. This problem is known as resource co-allocation which has evolved as a hot topic in network computing. How to design a kind of high-performance protocol for deadlock and livelock avoidance resource co-allocation becomes a challenging problem.(More)