Ruoming Jin

Ruoming Jin

Auto-generated profile, based on publicly available information

Ruoming Jin

Kent State University

Research Focus & Metrics

Academic Career Length

23Years (2004-Present)

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

Representative Publications

View All Publications
18 January 2010
Verified
Book Chapter
Closed access
PDF file
VLVictor E. Lee
Victor E. Lee
NRNing Ruan
Ning Ruan
RJRuoming Jin
Ruoming Jin
CACharu Aggarwal
Charu Aggarwal

17 September 2010 in Machine Learning
Verified
Journal Article
Closed access
PDF file
JTJie Tang
Jie Tang
JZJing Zhang
Jing Zhang
RJRuoming Jin
Ruoming Jin
ZYZi Yang
Zi Yang
KCKeke Cai
Keke Cai
ZSZhong Su
Zhong Su

29 October 2005 in Knowledge and Information Systems
Verified
Journal Article
Closed access
PDF file
RJRuoming Jin
Ruoming Jin
AGAnjan Goswami
Anjan Goswami
GAGagan Agrawal
Gagan Agrawal

24 October 2010 in Data Mining and Knowledge Discovery
Verified
Journal Article
Closed access
PDF file
YXYang Xiang
Yang Xiang
RJRuoming Jin
Ruoming Jin
DFDavid Fuhry
David Fuhry
FDFeodor F. Dragan
Feodor F. Dragan

17 May 2008 in Knowledge and Information Systems
Verified
Journal Article
Closed access
PDF file
RJRuoming Jin
Ruoming Jin
YBYuri Breitbart
Yuri Breitbart
CMChibuike Muoh
Chibuike Muoh

24 March 2009
Verified
Conference Paper
Open access
PDF file
DFDavid Fuhry
David Fuhry
RJRuoming Jin
Ruoming Jin
DZDonghui Zhang
Donghui Zhang
Given a set of n query points in a general metric space, a metric-space skyline (MSS) query asks what are the closest points to all these query points in the database. Here, consider for any point p, if there are no other points in the database which have less or equal distance to all the query points, then p is denoted as one of the closest points to the query points. This problem is a direct generalization of the recently proposed spatial-skyline query problem, where all the points are located in two or three dimensional Euclidean space. It is also closely related with the nearest neighbor (NN) query, the range query and the common skyline query problem. In this paper, we have developed new algorithms to aggressively prune non-skyline points from the search space. We also contribute two new optimization techniques to reduce the number of distance computations and dominance tests. Our experimental evaluation has shown the effectiveness and efficiency of our approach.