Graph-based methods are known to be successful in many machine learning and pattern classification tasks. These methods consider semi-structured data as graphs where nodes correspond to primitives (parts, interest points, segments, etc.) and edges characterize the relationships between these primitives. However, these non-vectorial graph data cannot be straightforwardly plugged into off-the-shelf machine learning algorithms without a preliminary step of -- explicit/implicit -- graph vectorization and embedding. This embedding process should be resilient to intra-class graph variations while being highly discriminant. In this paper, we propose a novel high-order stochastic graphlet embedding (SGE) that maps graphs into vector spaces. Our main contribution includes a new stochastic search procedure that efficiently parses a given graph and extracts/samples unlimitedly high-order graphlets. We consider these graphlets, with increasing orders, to model local primitives as well as their increasingly complex interactions. In order to build our graph representation, we measure the distribution of these graphlets into a given graph, using particular hash functions that efficiently assign sampled graphlets into isomorphic sets with a very low probability of collision. When combined with maximum margin classifiers, these graphlet-based representations have positive impact on the performance of pattern comparison and recognition as corroborated through extensive experiments using standard benchmark databases.
Subgraph Frequency Distribution Estimation using Graph Neural Networks
Stanford University(斯坦福大学);Australian National University(澳大利亚国立大学);The University of Hong Kong(香港大学);Rutgers University(罗格斯大学);Massachusetts Institute of Technology(麻省理工学院)
Your Contrastive Learning Is Secretly Doing Stochastic Neighbor Embedding
Huawei Noah’s Ark Lab(华为诺亚方舟实验室);Hong Kong University of Science and Technology(香港科技大学);Hong Kong University of Science and Technology (Guangzhou)(香港科技大学(广州));Qing Yuan Research Institute, Shanghai Jiao Tong University(上海交通大学清源研究院)
Stochastic-based Patch Filtering for Few-Shot Learning
AIBA, Departament de Matemàtiques & Informàtica Universitat de Barcelona(AIBA,数学与信息学院巴塞罗那大学);Departamento de Ingeniería de Sistemas y Computación Universidad Católica del Norte(系统与计算工程系天主教北方大学);Institute of Neuroscience, Universitat de Barcelona(神经科学研究所巴塞罗那大学)
Stochastic Vision Transformers with Wasserstein Distance-Aware Attention
Friedrich-Alexander University Erlangen-Nürnberg(埃尔朗根-纽伦堡弗里德里希-亚历山大大学);Ludwig Maximilian University of Munich(慕尼黑路德维希·马克西米利安大学);Imperial College London(帝国理工学院)