Discriminative prototype selection methods for graph embedding
نویسندگان
چکیده
منابع مشابه
Discriminative prototype selection methods for graph embedding
Graphs possess a strong representational power for many types of patterns. However, a main limitation in their use for pattern analysis derives from their difficult mathematical treatment. One way of circumventing this problem is that of transforming the graphs into a vector space by means of graph embedding. Such an embedding can be conveniently obtained by using a set of ‘‘prototype’’ graphs ...
متن کاملGene Function Prediction via Discriminative Graph Embedding
Gene function has been a subject of interest but it is far from fully understood. It is known that some genes have certain functions but it is not clear whether those are all the functions they have. It is a recent trend to use different means to predict gene functions; one of them is to use computational methods on large data sets. Different types of information are used in computational metho...
متن کاملDiscriminative Feature Selection for Uncertain Graph Classification
Mining discriminative features for graph data has attracted much attention in recent years due to its important role in constructing graph classifiers, generating graph indices, etc. Most measurement of interestingness of discriminative subgraph features are defined on certain graphs, where the structure of graph objects are certain, and the binary edges within each graph represent the "presenc...
متن کاملPrototype Selection Methods for On-line HWR
Prototype matching strategies such as DP-matching are powerful methods for character recognition problems with very large number of classes such as on-line Chinese character recognition. As for many problems with a large number of classes data is normally comparatively scarce for on-line Chinese characters and therefore prototype selection methods for use under these circumstances need to be ro...
متن کاملPremise Selection for Theorem Proving by Deep Graph Embedding
We propose a deep learning-based approach to the problem of premise selection: selecting mathematical statements relevant for proving a given conjecture. We represent a higher-order logic formula as a graph that is invariant to variable renaming but still fully preserves syntactic and semantic information. We then embed the graph into a vector via a novel embedding method that preserves the inf...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Pattern Recognition
سال: 2013
ISSN: 0031-3203
DOI: 10.1016/j.patcog.2012.11.020