Match!
Cuiping Li
Renmin University of China
Machine learningData miningSimRankComputer scienceTheoretical computer science
16Publications
6H-index
202Citations
What is this?
Publications 16
Newest
#1Yuncheng Wu (RUC: Renmin University of China)H-Index: 2
#2Ke Wang (SFU: Simon Fraser University)H-Index: 52
Last. Cuiping Li (RUC: Renmin University of China)H-Index: 6
view all 7 authors...
Group k-nearest neighbor ( kGNN) search allows a group of nmobile users to jointly retrieve kpoints from a location-based service provider (LSP) that minimizes the aggregate distance to them. We identify four protection objectives in the privacy preserving kGNN search: (i) every user's location should be protected from LSP; (ii) the group's query and the query answer should be protected from LSP; (iii) LSP's private database information should be protected from users; (iv) every u...
Source
#1Ying Liu (RUC: Renmin University of China)
#2Hui Peng (Ministry of Industry and Information Technology of the People's Republic of China)H-Index: 4
Last. Cuiping Li (RUC: Renmin University of China)H-Index: 6
view all 8 authors...
In recent years, wireless sensor networks (WSNs) have become a useful tool for environmental monitoring and information collection due to their strong sensory ability. Whereas WSNs utilize wireless communication and is usually deployed in an outdoors environment, which make them vulnerable to be attacked and then lead to the privacy disclosure of the monitored environment. SUM, as one common query among the queries of WSNs, is important to acquire a high-level understanding of the monitored envi...
Source
#1Yuncheng Wu (RUC: Renmin University of China)H-Index: 2
#2Ke Wang (SFU: Simon Fraser University)H-Index: 52
Last. Cuiping Li (RUC: Renmin University of China)H-Index: 6
view all 6 authors...
2 Citations
Sep 28, 2015 in SRDS (Symposium on Reliable Distributed Systems)
#1Lei DongH-Index: 3
#2Xuan Chen (RUC: Renmin University of China)H-Index: 1
Last. Cuiping LiH-Index: 6
view all 6 authors...
With high expansibility and efficient power usage, tiered wireless sensor networks are widely deployed in many fields as an important part of Internet of Things (IoTs). It is challenging to process range query while protecting sensitive data from adversaries. Moreover, most existing work focuses on privacy-preserving range query neglecting collusion attacks and probability attacks, which are more threatening to network security. In this paper, we first propose a secure range query protocol calle...
9 CitationsSource
Jun 8, 2015 in WAIM (Web-Age Information Management)
#1Jing Xu (RUC: Renmin University of China)H-Index: 1
#2Cuiping Li (RUC: Renmin University of China)H-Index: 6
Last. Hui Sun (RUC: Renmin University of China)H-Index: 2
view all 4 authors...
SimRank is one measure that compute the similarities between nodes in applications, where the returning of top-k query lists is often required. In this paper, we adopt SimRank as the similarity computation measure and re-write the original inefficient iterative equation into a non-iterative one, we call it Eigen-SimRank. We focus on multi-relational networks, where there may exist different kinds of relationships among nodes and query results may change with different perspectives. In order to c...
1 CitationsSource
Apr 13, 2015 in ICDE (International Conference on Data Engineering)
#1Shaoqing Wang (RUC: Renmin University of China)H-Index: 4
#2Benyou Zou (RUC: Renmin University of China)H-Index: 3
Last. Hong Chen (RUC: Renmin University of China)H-Index: 11
view all 6 authors...
It is popular for most people to read news online since the web sites can provide access to news articles from millions of sources around the world. For these news web sites, the key challenge is to help users find related news articles to read. In this paper, we present a system called CROWN (Context-aware RecOmmender for Web News) to do Chinese news recommendation. By recommendation, the system can retrieve personalized fresh and relevant news articles to mobile users according to their partic...
6 CitationsSource
#1Benyou Zou (RUC: Renmin University of China)H-Index: 3
#2Cuiping Li (RUC: Renmin University of China)H-Index: 6
Last. Hong Chen (RUC: Renmin University of China)H-Index: 11
view all 4 authors...
Abstract Recommendation systems play an important role in many practical applications that help users manage information and provide personalized recommendations. The context in which a choice is made is an important factor for recommendation systems. Recently, researchers extended the classical matrix factorization to enable generic integration of contextual information by modeling the relevant data as a tensor. However, current tensor factorization methods have two important limitations: (1) c...
27 CitationsSource
#1Lingxia Du (RUC: Renmin University of China)H-Index: 1
#2Cuiping Li (RUC: Renmin University of China)H-Index: 6
Last. Yinglong Zhang (RUC: Renmin University of China)H-Index: 2
view all 5 authors...
Existing studies on graph-based analysis focus on standard graphs that are precise and complete. However, in many prevalent application domains, such as social, biological, and mobile networks, the existence of an edge in a graph is best captured by a likelihood measure or a probability. This paper investigates the problem of node similarity computation on large uncertain graphs. We first extend the well-known SimRank to define meaningful similarity measure on probabilistic graphs, and then prop...
12 CitationsSource
#1Xiaoying ZhangH-Index: 4
#2Lei DongH-Index: 3
Last. Cuiping LiH-Index: 6
view all 6 authors...
Wireless sensor networks (WSNs) are indispensable building blocks for the Internet of Things (IoT). With the development of WSNs, privacy issues have drawn more attention. Existing work on the privacy-preserving range query mainly focuses on privacy preservation and integrity verification in two-tiered WSNs in the case of compromisedmaster nodes, but neglects the damage of node collusion. In this paper, we propose a series of collusion-aware privacy-preserving range query protocols in two-tiered...
11 CitationsSource
Jun 16, 2014 in WAIM (Web-Age Information Management)
#1Yinglong Zhang (ECJTU: East China Jiaotong University)H-Index: 2
#2Cuiping Li (RUC: Renmin University of China)H-Index: 6
Last. Hong Chen (RUC: Renmin University of China)H-Index: 11
view all 4 authors...
Link-based similarity measures play significant role in many graph based applications. Consequently, measuring nodes similarity in a graph is a fundamental problem of graph data mining. Personalized PageRank (PPR) and SimRank (SR) have emerged as the most popular and influential link-based similarity measures. In practice, PPR and SR scores are achieved by iterative computing. With increasing of iterations, the computations incur heavy overhead. The ideal solution is that computing similarity wi...
1 CitationsSource
12