#### Filter Results:

- Full text PDF available (109)

#### Publication Year

1997

2016

- This year (0)
- Last 5 years (31)
- Last 10 years (79)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Data Set Used

#### Key Phrases

Learn More

- Ruoming Jin, Lin Liu, Bolin Ding, Haixun Wang
- PVLDB
- 2011

Driven by the emerging network applications, querying and mining uncertain graphs has become increasingly important. In this paper, we investigate a fundamental problem concerning uncertain graphs, which we call the distance-constraint reachability (DCR) problem: Given two vertices s and t, what is the probability that the distance from s to t is less than… (More)

- Ruoming Jin, Yang Xiang, Ning Ruan, Haixun Wang
- SIGMOD Conference
- 2008

Efficiently processing queries against very large graphs is an important research topic largely driven by emerging real world applications, as diverse as XML databases, GIS, web mining, social network analysis, ontologies, and bioinformatics. In particular, graph reachability has attracted a lot of research attention as reachability queries are not only… (More)

- Ruoming Jin, Yang Xiang, Ning Ruan, David Fuhry
- SIGMOD Conference
- 2009

Reachability queries on large directed graphs have attracted much attention recently. The existing work either uses spanning structures, such as chains or trees, to compress the complete transitive closure, or utilizes the 2-hop strategy to describe the reachability. Almost all of these approaches work well for very sparse graphs. However, the challenging… (More)

- Ruoming Jin, Gagan Agrawal
- Fifth IEEE International Conference on Data…
- 2005

Frequent item set mining is a core data mining operation and has been extensively studied over the last decade. This paper takes a new approach for this problem and makes two major contributions. First, we present a one pass algorithm for frequent item set mining, which has deterministic bounds on the accuracy, and does not require any out-of-core summary… (More)

- Jie Tang, Ruoming Jin, Jing Zhang
- 2008 Eighth IEEE International Conference on Data…
- 2008

In this paper, we propose a unified topic modeling approach and its integration into the random walk framework for academic search. Specifically, we present a topic model for simultaneously modeling papers, authors, and publication venues. We combine the proposed topic model into the random walk framework. Experimental results show that our proposed… (More)

- Ruoming Jin, Lin Liu, Charu C. Aggarwal
- KDD
- 2011

In this paper, we investigate the highly reliable subgraph problem, which arises in the context of uncertain graphs. This problem attempts to identify all induced subgraphs for which the probability of connectivity being maintained under uncertainty is higher than a given threshold. This problem arises in a wide range of network applications, such as… (More)

- Ruoming Jin, Hui Hong, Haixun Wang, Ning Ruan, Yang Xiang
- SIGMOD Conference
- 2010

Our world today is generating huge amounts of graph data such as social networks, biological networks, and the semantic web. Many of these real-world graphs are edge-labeled graphs, i.e., each edge has a label that denotes the relationship between the two vertices connected by the edge. A fundamental research problem on these labeled graphs is how to handle… (More)

- Yang Xiang, Ruoming Jin, David Fuhry, Feodor F. Dragan
- KDD
- 2008

Transactional data are ubiquitous. Several methods, including frequent itemsets mining and co-clustering, have been proposed to analyze transactional databases. In this work, we propose a new research problem to succinctly summarize transactional databases. Solving this problem requires linking the high level structure of the database to a potentially huge… (More)

- Ruoming Jin, Gagan Agrawal
- KDD
- 2003

Decision tree construction is a well studied problem in data mining. Recently, there has been much interest in mining streaming data. Domingos and Hulten have presented a one-pass algorithm for decision tree construction. Their work uses Hoeffding inequality to achieve a probabilistic bound on the accuracy of the tree constructed.In this paper, we revisit… (More)

- Ruoming Jin, Ning Ruan, Yang Xiang, Victor E. Lee
- SIGMOD Conference
- 2012

The distance query, which asks the length of the shortest path from a vertex $u$ to another vertex <i>v</i>, has applications ranging from link analysis, semantic web and other ontology processing, to social network operations. Here, we propose a novel labeling scheme, referred to as <i>Highway-Centric Labeling</i>, for answering distance queries in a large… (More)