4972 search results - page 238 / 995 » Ranking on graph data |
197
click to vote
KDD
2007
ACM
16 years 24 days ago
2007
ACM
In this paper, we propose a new method called Prototype Ranking (PR) designed for the stock selection problem. PR takes into account the huge size of real-world stock data and app...
191
Voted
OTM
2005
Springer
16 years 4 days ago
2005
Springer
RDF has been proposed by W3C as a metadata model and language for representing information about resources in WWW. In this paper we introduce Multidimensional RDF (or MRDF), as an ...
160
click to vote
ICDM
2007
IEEE
16 years 1 months ago
2007
IEEE
—Defining the support (or frequency) of a subgraph is trivial when a database of graphs is given: it is simply the number of graphs in the database that contain the subgraph. Ho...
155
Voted
GBRPR
2007
Springer
16 years 25 days ago
2007
Springer
In this paper we propose a quadratic programming approach to computing the edit distance of graphs. Whereas the standard edit distance is defined with respect to a minimum-cost ed...
158
click to vote
ICDM
2006
IEEE
16 years 21 days ago
2006
IEEE
Mining graph databases for frequent subgraphs has recently developed into an area of intensive research. Its main goals are to reduce the execution time of the existing basic algo...