# Tag Info

### What are graph embedding?

What are graph Embeddings ? "Graph Embeddings" is a hot area today in machine learning. It basically means finding "latent vector representation" of graphs which captures the topology (in very basic ...
• 1,217
Accepted

### What are graph embedding?

Graph embedding learns a mapping from a network to a vector space, while preserving relevant network properties. Vector spaces are more amenable to data science than graphs. Graphs contain edges and ...
• 19.4k

### Anconda R version - How to upgrade to 4.0 and later

You need to create a new environment and then you can install R 4.+ in Anaconda. Follow these steps. conda create --name r4-base After activating ...
• 281
Accepted

### In elbow curve how to find the point from where the curve starts to rise?

TL;DR Use the two functions from below to get the index of the elbow: elbow_index = find_elbow(data, get_data_radiant(data)) **Edit:** I put all of the code below ...
• 1,206
Accepted

### Large Graphs: NetworkX distributed alternative

Good , old and unsolved question! Distributed processing of large graphs as far as I know (speaking as a graph guy) has 2 different approaches, with the knowledge of Big Data frameworks or without it. ...
• 6,432

### How to use Scikit-Learn Label Propagation on graph structured data?

Answering my own question here, as I hope it will be useful to some readers. Scikit-learn is primarily designed to deal with vector structured data. Hence, if you want to perform label propagation/...
Accepted

### Use Cases of Neo4J and Spark GraphX

Neo4j and Spark GraphX are meant for solving problem at different level and they are complimentary to each other. They can be connected by Neo4j's Mazerunner extension: Mazerunner is a Neo4j ...
• 266
Accepted

### Visualize graph network with more than 30k edges

Yes There are! Networkx I think 20k-30k node-edge would be OK on Networkx, IF YOU HAVE A GOOD MACHINE! Networkx is a great library in Python particularly for Graph Analysis so you have access to ...
• 6,432

### Large Graphs: NetworkX distributed alternative

In this present moment, Apache has develop a powerfull API called PySpark. And you can setup Graphframes directly from pyspark command line. Launch from you shell ...

### What is the difference between affinity matrix eigenvectors and graph Laplacian eigenvectors in the context of spectral clustering?

The concept is the same but you are getting confused by the type of data. Spectral Clustering as Ng et al. explain is about clustering standard data while the Laplacian matrix is a graph derived ...
• 6,432
Accepted

### Network analysis classic datasets

What you are looking for can be found in KONECT (the website is down as I'm writing this but it should be fixed soon!). It's almost the most comprehensive data collection for network analysis. But the ...
• 6,432

### Finding groups of friends in social network data

Community Detection and Clique Percolation: This is a community detection problem. Here is a very detailed review article surveying the state of the art. The Clique Percolation Method is also ...
Accepted

### Use cases for graph algorithms and graph data structures in finance and banking

There are many use cases of graph theory in Finance industry and it is a very broad question. As Emre said can be used for Fraud Detection, Risk Modelling, Economic Networks etc. These below links ...
• 2,352
Accepted

### What is a discrimination threshold of binary classifier?

Just to add a bit. Like it was mentioned before, if you have a classifier (probabilistic) your output is a probability (a number between 0 and 1), ideally you want to say that everything larger than ...
• 305