• Publications
  • Influence
Indexing multi-dimensional data in a cloud system
TLDR
We propose RT-CAN, a multi-dimensional indexing scheme in epiC to support efficient multi- dimensional query processing in a Cloud system. Expand
  • 181
  • 12
  • PDF
Discovering frequent subgraphs over uncertain graph databases under probabilistic semantics
TLDR
This paper investigates frequent subgraph mining on uncertain graphs under probabilistic semantics and proposes an approximate mining algorithm. Expand
  • 113
  • 12
  • PDF
Composite event coverage in wireless sensor networks with heterogeneous sensors
TLDR
This paper investigates the composite event coverage problem with the purpose of optimizing coverage quality subject to the constraint of not exceeding the total budget. Expand
  • 69
  • 10
Dynamic constraints for record matching
TLDR
This paper investigates constraints for matching records from unreliable data sources. Expand
  • 87
  • 7
  • PDF
A novel approach for efficient supergraph query processing on graph databases
TLDR
This paper first proposes an optimal compact method for organizing graph databases. Expand
  • 51
  • 7
  • PDF
Rule-Based Method for Entity Resolution
TLDR
The objective of entity resolution (ER) is to identify records referring to the same real-world entity. Expand
  • 43
  • 6
  • PDF
Mining Frequent Subgraph Patterns from Uncertain Graph Data
TLDR
This paper investigates the problem of mining uncertain graph data and especially focuses on mining frequent subgraph patterns on an uncertain graph database. Expand
  • 159
  • 4
Frequent subgraph pattern mining on uncertain graph data
TLDR
This paper investigates the problem of mining frequent subgraph patterns from uncertain graph data. Expand
  • 53
  • 4
  • PDF
Unsupervised Outlier Detection in Sensor Networks Using Aggregation Tree
TLDR
A new unsupervised approach is proposed to detect global top noutliers in the network through exchanging short messages in the whole tree. Expand
  • 87
  • 4
Finding top-k maximal cliques in an uncertain graph
TLDR
An optimized branch-and-bound algorithm is developed to find top-k maximal cliques, which adopts efficient pruning rules, a new searching strategy and effective preprocessing methods. Expand
  • 91
  • 3
...
1
2
3
4
5
...