[Edit]

Ruoming Jin [FOAF]  [Follow]

Position: assistant professor
Affiliation: Department of Computer Science and Engineering (CSE) the Ohio State University
Address: 772 Dreese Lab. the Ohio State University
Phone: (614)688-8486
Email:
Homepage: http://www.cse.ohio-state.edu/~jinr/
[Edit]

Statistics: H-index: 10 (See all experts' h-index.)
total citation number: 475
highest-cited paper: Efficient decision tree construction on streaming data (2003) at KDD (Cited By 82)

Research Interest:

Parallel Data Cube Construction, Data Mining Algorithms, Compiling Data Intensive Applications, Data Distribution, Data Intensive Computations

Show Temporal Interests (Do you want to see the change of his/her research interests?)

Education: [Edit]

Phd University: The Ohio State University Phd Major: Computer Science Phd Date: 2004
Master University: University of Delaware Master Major: Computer Science Master Date: 2001

Publications: [Edit disambiguation Result]

2009(9)
[57]Ning RuanRuoming JinVictor E. LeeKun HuangA Sparsification Approach for Temporal Graphical Model Decomposition. 2009. pp.447~456   [Bibtex]
[56]Ruoming JinYuri BreitbartRong LiA Tree-Based Framework for Difference Summarization. 2009. pp.209~218   [Bibtex]
[55]David FuhryRuoming JinDonghui ZhangEfficient skyline computation in metric space.  EDBT'2009. pp.1042~1051    Cited By 2[Bibtex]
[54]Ruoming JinScott McCallenYuri BreitbartDavid FuhryDong WangEstimating the number of frequent itemsets in a large database.  EDBT'2009. pp.505~516    Cited By 2[Bibtex]
[53]Xingquan ZhuRuoming JinMultiple Information Sources Cooperative Learning.  IJCAI'2009. pp.1369~1376    Cited By 1[Bibtex]
[52]Ruoming JinYang XiangLin LiuCartesian contour: a concise representation for a collection of frequent sets.  KDD'2009. pp.417~426    Cited By 1[Bibtex]
[51]Xiaoxi DuRuoming JinLiang DingVictor E. LeeJohn H. Thornton JrMigration motif: a spatial - temporal pattern mining approach for financial markets.  KDD'2009. pp.1135~1144    Cited By 1[Bibtex]
[50]Ruoming JinYang XiangNing RuanDavid Fuhry3-HOP: a high-compression indexing scheme for reachability query.  SIGMOD Conference'2009. pp.813~826    Cited By 11[Bibtex]
[49]Ruoming JinYuri BreitbartChibuike MuohData discretization unification. Knowl. Inf. Syst., 2009: 1~29    Cited By 9[Bibtex]
2008(9)
[48]Ruoming JinDavid FuhryAbdulkareem AlaliCost-based query optimization for complex pattern mining on multiple databases.  EDBT'2008. pp.380~391    Cited By 1[Bibtex]
[47]Ruoming JinYang XiangDavid FuhryFeodor F. DraganOverlapping Matrix Pattern Visualization: A Hypergraph Approach.  ICDM'2008. pp.313~322    Cited By 1[Bibtex]
[46]Jie TangRuoming JinJing ZhangA Topic Modeling Approach and Its Integration into the Random Walk Framework for Academic Search.  ICDM'2008. pp.1055~1060    Cited By 6[Bibtex]
[45]Ruoming JinMuad Abu-AtaYang XiangNing RuanEffective and efficient itemset pattern summarization: regression-based approaches.  KDD'2008. pp.399~407    Cited By 10[Bibtex]
[44]Yang XiangRuoming JinDavid FuhryFeodor F. DraganSuccinct summarization of transactional databases: an overlapped hyperrectangle scheme.  KDD'2008. pp.758~766    Cited By 10[Bibtex]
[43]Ruoming JinYang XiangNing RuanHaixun WangEfficiently answering reachability queries on very large directed graphs.  SIGMOD Conference'2008. pp.595~608    Cited By 19[Bibtex]
[42]Fan WangGagan AgrawalRuoming JinQuery Planning for Searching Inter-dependent Deep-Web Databases.  SSDBM'2008. pp.24~41    Cited By 3[Bibtex]
[41]Leonid GlimcherRuoming JinGagan AgrawalMiddleware for data mining applications on clusters and grids. J. Parallel Distrib. Comput., 2008: 37~53    Cited By 6[Bibtex]
[40]Xingquan ZhuRuoming JinYuri BreitbartGagan AgrawalMMIS07, 08: mining multiple information sources workshop report. SIGKDD Explorations, 2008: 61~65   [Bibtex]
2007(4)
[39]Fan WangRuoming JinGagan AgrawalHelen PiontkivskaGraph and Topological Structure Mining on Scientific Articles.  BIBE'2007. pp.1318~1322   [Bibtex]
[38]Fan WangGagan AgrawalRuoming JinHelen PiontkivskaSNPMiner: A Domain-Specific Deep Web Mining Tool.  BIBE'2007. pp.192~199    Cited By 3[Bibtex]
[37]Ruoming JinYuri BreitbartChibuike MuohData Discretization Unification.  ICDM'2007. pp.183~192    Cited By 9[Bibtex]
[36]Ruoming JinScott McCallenEivind AlmaasTrend Motif: A Graph Mining Approach for Analysis of Dynamic Complex Networks.  ICDM'2007. pp.541~546    Cited By 5[Bibtex]
2006(7)
[35]Kaushik SinhaRuoming JinGagan AgrawalHelen PiontkivskaExploratory Tools for FollowUp Studies to Microarray Experiments.  BIBE'2006. pp.81~85   [Bibtex]
[34]Xuan ZhangRuoming JinGagan AgrawalAssigning Schema Labels Using Ontology And Hueristics.  BIBE'2006. pp.269~280    Cited By 2[Bibtex]
[33]Chao WangSrinivasan ParthasarathyRuoming JinA Decomposition-Based Probabilistic Framework for Estimating the Selectivity of XML Twig Queries.  EDBT'2006. pp.533~551    Cited By 4[Bibtex]
[32]Ruoming JinGagan AgrawalSystematic Approach for Optimizing Complex Mining Tasks on Multiple Databases.  ICDE'2006. pp.17~17    Cited By 13[Bibtex] [PDF]
[31]Ruoming JinLeonid GlimcherChris JermaineGagan AgrawalNew Sampling-Based Estimators for OLAP Queries.  ICDE'2006. pp.18~18    Cited By 6[Bibtex] [PDF]
[30]Leonid GlimcherRuoming JinGagan AgrawalFREERIDE-G: Supporting Applications that Mine Remote.  ICPP'2006. pp.109~118   [Bibtex] [PDF]
[29]Ruoming JinAnjan GoswamiGagan AgrawalFast and exact out-of-core and distributed k-means clustering. Knowl. Inf. Syst., 2006: 17~40    Cited By 21[Bibtex]
2005(9)
[28]Kaushik SinhaXuan ZhangRuoming JinGagan AgrawalUsing Data Mining Techniques to Learn Layouts of Flat-File Biological Datasets.  BIBE'2005. pp.177~184   [Bibtex]
[27]Kaushik SinhaXuan ZhangRuoming JinGagan AgrawalLearning Layouts of Biological Datasets Semi-automatically.  DILS'2005. pp.31~45    Cited By 4[Bibtex]
[26]Ruoming JinGagan AgrawalAn Algorithm for In-Core Frequent Itemset Mining on Streaming Data.  ICDM'2005. pp.210~217    Cited By 55[Bibtex] [PDF]
[25]Leonid GlimcherGagan AgrawalSameep MehtaRuoming JinRaghu MachirajuParallelizing a Defect Detection and Categorization Application.  IPDPS'2005.     Cited By 7[Bibtex] [PDF]
[24]Ruoming JinKaushik SinhaGagan AgrawalSimultaneous optimization of complex mining tasks with a knowledgeable cache.  KDD'2005. pp.600~605    Cited By 10[Bibtex] [PDF]
[23]Ruoming JinChao WangDmitrii PolshakovSrinivasan ParthasarathyGagan AgrawalDiscovering frequent topological structures from graph datasets.  KDD'2005. pp.606~611    Cited By 28[Bibtex] [PDF]
[22]Ruoming JinGagan AgrawalA methodology for detailed performance modeling of reduction computations on SMP machines. Perform. Eval., 2005: 73~105    Cited By 5[Bibtex]
[21]Ruoming JinGe YangGagan AgrawalShared Memory Parallelization of Data Mining Algorithms: Techniques, Programming Interface, and Performance. IEEE Trans. Knowl. Data Eng., 2005: 71~89    Cited By 79[Bibtex] [PDF]
[20]Ruoming JinKarthikeyan VaidyanathanGe YangGagan AgrawalCommunication and Memory Optimal Parallel Data Cube Construction. IEEE Trans. Parallel Distrib. Syst., 2005: 1105~1119    Cited By 10[Bibtex] [PDF]
2004(2)
[19]Anjan GoswamiRuoming JinGagan AgrawalFast and Exact Out-of-Core K-Means Clustering.  ICDM'2004. pp.83~90    Cited By 17[Bibtex] [PDF]
[18]Ruoming JinKarthik VaidyanathanGe YangGagan AgrawalUsing Tiling to Scale Parallel Data Cube Construction.  ICPP'2004. pp.365~372    Cited By 1[Bibtex] [PDF]
2003(7)
[17]Ruoming JinGe YangGagan AgrawalParallel Data Cube Construction: Algorithms, Theoretical Analysis, and Experimental Evaluation.  HiPC'2003. pp.74~84    Cited By 1[Bibtex] [PDF]
[16]Ruoming JinGe YangKarthik VaidyanathanGagan AgrawalCommunication and Memory Optimal Parallel Data Cube Construction.  ICPP'2003. pp.573~580   [Bibtex] [PDF]
[15]Xiaogang LiRuoming JinGagan AgrawalA Compilation Framework for Distributed Memory Parallelization of Data Mining Algorithms.  IPDPS'2003. pp.7~7    Cited By 1[Bibtex] [PDF]
[14]Ge YangRuoming JinGagan AgrawalImpact of Data Distribution, Level of Parallelism, and Communication Frequency on Parallel Data Cube Construction.  IPDPS'2003. pp.66~66    Cited By 1[Bibtex]
[13]Ruoming JinGagan AgrawalEfficient decision tree construction on streaming data.  KDD'2003. pp.571~576    Cited By 82[Bibtex] [PDF]
[12]Ruoming JinGagan AgrawalCommunication and Memory Efficient Parallel Decision Tree Construction.  SDM'2003.     Cited By 20[Bibtex]
[11]Ge YangRuoming JinGagan AgrawalImplementing data cube construction using a cluster middleware: algorithms, implementation experience, and performance evaluation. Future Generation Comp. Syst., 2003: 533~550    Cited By 8[Bibtex]
2002(6)
[10]Ge YangRuoming JinGagan AgrawalImplementing Data Cube Construction using a Cluster Middleware: Algorithms, Implementation Experience, and Performance Evaluation.  CCGRID'2002. pp.84~92    Cited By 8[Bibtex]
[9]Ruoming JinGagan AgrawalShared Memory Parallelization of Decision Tree Construction Using a General Data Mining Middleware.  Euro-Par'2002. pp.346~354    Cited By 6[Bibtex]
[8]Ruoming JinGagan AgrawalDesign and Evaluation of a High-Level Interface for Data Mining.  IPDPS'2002.     Cited By 2[Bibtex]
[7]Xiaogang LiRuoming JinGagan AgrawalCompiler and Runtime Support for Shared Memory Parallelization of Data Mining Algorithms.  LCPC'2002. pp.265~279    Cited By 3[Bibtex] [PDF]
[6]Ruoming JinGagan AgrawalShared Memory Paraellization of Data Mining Algorithms: Techniques, Programming Interface, and Performance.  SDM'2002.    [Bibtex]
[5]Ruoming JinGagan AgrawalPerformance prediction for random write reductions: a case study in modeling shared memory programs.  SIGMETRICS'2002. pp.117~128    Cited By 16[Bibtex] [PDF]
2001(2)
[4]Ruoming JinGagan AgrawalAn efficient association mining implementation on clusters of SMP.  IPDPS'2001. pp.156~156   [Bibtex]
[3]Gagan AgrawalRuoming JinXiaogang LiCompiler and Middleware Support for Scalable Data Mining.  LCPC'2001. pp.33~51   [Bibtex] [PDF]
2000(2)
[2]Renato FerreiraGagan AgrawalRuoming JinJoel H. SaltzCompiling Data Intensive Applications with Spatial Coordinates.  LCPC'2000. pp.339~354    Cited By 9[Bibtex] [PDF]
[1]Gagan AgrawalRenato FerreiraRuoming JinJoel H. SaltzHigh Level Programming Methodologies for Data Intensive Computations.  LCR'2000. pp.32~43   [Bibtex] [PDF]