66 search results - page 1 / 14 » Finding Graph Matchings in Data Streams |
APPROX
2005
Springer
13 years 11 months ago
2005
Springer
ICDM
2008
IEEE
14 years 6 days ago
2008
IEEE
Nonnegative matrix factorization (NMF) is a versatile model for data clustering. In this paper, we propose several NMF inspired algorithms to solve different data mining problems....
BMCBI
2008
13 years 5 months ago
2008
Background: Biomedical and chemical databases are large and rapidly growing in size. Graphs naturally model such kinds of data. To fully exploit the wealth of information in these...
ICPR
2002
IEEE
14 years 6 months ago
2002
IEEE
The graph is an essential data structure for representing relational information. When graphs are used to represent objects, comparing objects amounts to graph matching. Inexact g...
ICDE
2009
IEEE
13 years 3 months ago
2009
IEEE
Search over graph databases has attracted much attention recently due to its usefulness in many fields, such as the analysis of chemical compounds, intrusion detection in network t...