Nikos Mamoulis

Nikos Mamoulis

Auto-generated profile, based on publicly available information

Nikos Mamoulis

University of Hong Kong

Research Focus & Metrics

Academic Career Length

22Years (2005-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
30 September 2008 in The VLDB Journal
Verified
Journal Article
Closed access
PDF file
MYMan Lung Yiu
Man Lung Yiu
NMNikos Mamoulis
Nikos Mamoulis

1 September 2006 in The VLDB Journal
Verified
Journal Article
Closed access
PDF file
MYMan Lung Yiu
Man Lung Yiu
YTYufei Tao
Yufei Tao
NMNikos Mamoulis
Nikos Mamoulis

10 June 2010 in The VLDB Journal
Verified
Journal Article
Open access
PDF file
MTManolis Terrovitis
Manolis Terrovitis
NMNikos Mamoulis
Nikos Mamoulis
PKPanos Kalnis
Panos Kalnis
In this paper, we study the problem of protecting privacy in the publication of set-valued data. Consider a collection of supermarket transactions that contains detailed information about items bought together by individuals. Even after removing all personal characteristics of the buyer, which can serve as links to his identity, the publication of such data is still subject to privacy attacks from adversaries who have partial knowledge about the set. Unlike most previous works, we do not distinguish data as sensitive and non-sensitive, but we consider them both as potential quasi-identifiers and potential sensitive data, depending on the knowledge of the adversary. We define a new version of the k-anonymity guarantee, the k m -anonymity, to limit the effects of the data dimensionality, and we propose efficient algorithms to transform the database. Our anonymization model relies on generalization instead of suppression, which is the most common practice in related works on such data. We develop an algorithm that finds the optimal solution, however, at a high cost that makes it inapplicable for large, realistic problems. Then, we propose a greedy heuristic, which performs generalizations in an Apriori, level-wise fashion. The heuristic scales much better and in most of the cases finds a solution close to the optimal. Finally, we investigate the application of techniques that partition the database and perform anonymization locally, aiming at the reduction of the memory consumption and further scalability. A thorough experimental evaluation with real datasets shows that a vertical partitioning approach achieves excellent results in practice.

1 April 2007
Verified
Conference Paper
Closed access
MYMan Lung Yiu
Man Lung Yiu
XDXiangyuan Dai
Xiangyuan Dai
NMNikos Mamoulis
Nikos Mamoulis
Michail VaitisMichail Vaitis
Michail Vaitis
A spatial preference query ranks objects based on the qualities of features in their spatial neighborhood. For example, consider a real estate agency office that holds a database with available flats for lease. A customer may want to rank the flats with respect to the appropriateness of their location, defined after aggregating the qualities of other features (e.g., restaurants, cafes, hospital, market, etc.) within a distance range from them. In this paper, we formally define spatial preference queries and propose appropriate indexing techniques and search algorithms for them. Our methods are experimentally evaluated for a wide range of problem settings.

1 February 2005 in Machine Learning
Verified
Journal Article
Closed access
PDF file
YSYutao Shou
Yutao Shou
NMNikos Mamoulis
Nikos Mamoulis
DCDavid W. Cheung
David W. Cheung

17 July 2014 in IEEE Transactions on Knowledge and Data Engineering
Verified
Journal Article
Closed access
KMKyriakos Mouratidis
Kyriakos Mouratidis
JLJing Li
Jing Li
YTYu Tang
Yu Tang
NMNikos Mamoulis
Nikos Mamoulis
The diffusion of social networks introduces new challenges and opportunities for advanced services, especially so with their ongoing addition of location-based features. We show how applications like company and friend recommendation could significantly benefit from incorporating social and spatial proximity, and study a query type that captures these two-fold semantics. We develop highly scalable algorithms for its processing, and enhance them with elaborate optimizations. Finally, we use real social network data to empirically verify the efficiency and efficacy of our solutions.