Search for: All records

Traditional network embedding primarily focuses on learning a continuous vector representation for each node, preserving network structure and/or node content information, such that off-the-shelf machine learning algorithms can be easily applied to the vector-format node representations for network analysis. However, the learned continuous vector representations are inefficient for large-scale similarity search, which often involves finding nearest neighbors measured by distance or similarity in a continuous vector space. In this article, we propose a search efficient binary network embedding algorithm called BinaryNE to learn a binary code for each node, by simultaneously modeling node context relations and node attribute relations through a three-layer neural network. BinaryNE learns binary node representations using a stochastic gradient descent-based online learning algorithm. The learned binary encoding not only reduces memory usage to represent each node, but also allows fast bit-wise comparisons to support faster node similarity search than using Euclidean or other distance measures. Extensive experiments and comparisons demonstrate that BinaryNE not only delivers more than 25 times faster search speed, but also provides comparable or better search quality than traditional continuous vector based network embedding methods. The binary codes learned by BinaryNE also render competitive performance on node classification and node clustering tasks. The source code of the BinaryNE algorithm is available at https://github.com/daokunzhang/BinaryNE. 

We designed a novel multicoordinating ligand based on the N-heterocyclic carbene (NHC) anchoring molecules and applied them for stabilizing luminescent quantum dots in aqueous media. The ligand is synthesized via nucleophilic addition reaction between amine-appended imidazole/poly(ethylene glycol) compounds and poly(isobutylene-alt-maleic anhydride) (PIMA), followed by carbene generation. We find that these NHC-based polymers exhibit fast and robust coordinating affinity to CdSe QDs overcoated with ZnS shells. The removal of hydrophobic coating and the generation of carbene are demonstrated by 1H NMR spectroscopy. 13C NMR spectroscopy confirms the existence of carbene-Zn complexes which is crucial for binding transition-metals on QD surfaces. These QDs exhibit absorption and emission features with little to no change before and after cap exchange, and their PL intensity is increased under light exposure. Excellent colloidal stability of these QD samples is observed in a wide range of competitive conditions over long period of time. Agarose gel electrophoresis indicates that the polymer coating imparts QDs with good compatibility in different aqueous buffers, and it prevents protein adsorption. 

Attributed network embedding aims to learn lowdimensional vector representations for nodes in a network, where each node contains rich attributes/features describing node content. Because network topology structure and node attributes often exhibit high correlation, incorporating node attribute proximity into network embedding is beneficial for learning good vector representations. In reality, large-scale networks often have incomplete/missing node content or linkages, yet existing attributed network embedding algorithms all operate under the assumption that networks are complete. Thus, their performance is vulnerable to missing data and suffers from poor scalability. In this paper, we propose a Scalable Incomplete Network Embedding (SINE) algorithm for learning node representations from incomplete graphs. SINE formulates a probabilistic learning framework that separately models pairs of node-context and node-attribute relationships. Different from existing attributed network embedding algorithms, SINE provides greater flexibility to make the best of useful information and mitigate negative effects of missing information on representation learning. A stochastic gradient descent based online algorithm is derived to learn node representations, allowing SINE to scale up to large-scale networks with high learning efficiency. We evaluate the effectiveness and efficiency of SINE through extensive experiments on real-world networks. Experimental results confirm that SINE outperforms state-of-the-art baselines in various tasks, including node classification, node clustering, and link prediction, under settings with missing links and node attributes. SINE is also shown to be scalable and efficient on large-scale networks with millions of nodes/edges and high-dimensional node features.