orange
NetworkX
Our great sponsors
orange | NetworkX | |
---|---|---|
27 | 61 | |
4,604 | 14,153 | |
1.7% | 1.4% | |
9.6 | 9.6 | |
6 days ago | 7 days ago | |
Python | Python | |
GNU General Public License v3.0 or later |
Stars - the number of stars that a project has on GitHub. Growth - month over month growth in stars.
Activity is a relative number indicating how actively a project is being developed. Recent commits have higher weight than older ones.
For example, an activity of 9.0 indicates that a project is amongst the top 10% of the most actively developed projects that we are tracking.
orange
-
Hierarchical Clustering
I know I've tooted its horn before, but Orange3 is a pretty neat Python-based GUI platform that makes this and a metric buttload of other statistical/ML techniques available to non-programmer types.
Just watch out for null character `x00` in the corpus. That always seems to kill it stone dead.
https://orangedatamining.com/
https://orange3.readthedocs.io/projects/orange-visual-progra...
- Orange Data Mining
-
The Graph of Wikipedia [video]
For all you folks who aren't ace programmer types, the Orange3[1] platform gives you a very miniaturized[2] ability to turn out these sorts of visualizations very rapidly. It's not the most stable thing in the world, but the node-based ML workflow designer is worth the price of admission all by itself.
[1] https://orangedatamining.com/
[2] The Wikipedia extension in Text limits each search result to 25 articles, so sucking all of Wikipedia is . . well, Orange text analytics crashes when I look at it sideways with a null character, so let's not think about what would happen.
- Ask HN: What Underrated Open Source Project Deserves More Recognition?
-
Taxonomy Management?
First is identifying the "similar" things in a corpus. Best way I know to do that, for non-programmer audiences, is the Orange Data Mining tool, which gives you a node-based text mining interface to perform statistical analysis on text. Hierarchical Clustering shows - very rapidly - how similar your "modules" are, which ones are most similar. There's many other techniques (semantic viewer, similarity hash, etc) as well - the right one will depend on how your content is laying about.
- Orange: Open-source machine learning and data visualization
-
What exactly is AutoGPT?
Both tools are ripoffs of a data mining framework named Orange 3
-
Why don't more people use Altair for python Visualizations instead of Plotly?
You should also check out Orange Data Mining, it allows to create a lot of charts, filter data from a chart to another, build ML models, predictions and a lot more. And you can do it with zero code.
-
Advice on Transitioning to Data Science/ML/AI without Coding Experience
You can start with a free GUI based tool Orange. It is a component based data science workflow tool, which you can use to handle 60-75% of the traditional data science tasks from classification, regression, to basic neural networks.
- Has anybody used Orange?
NetworkX
-
Routes to LANL from 186 sites on the Internet
Built from this data... https://github.com/networkx/networkx/blob/main/examples/grap...
-
The Hunt for the Missing Data Type
I think one of the elements that author is missing here is that graphs are sparse matrices, and thus can be expressed with Linear Algebra. They mention adjacency matrices, but not sparse adjacency matrices, or incidence matrices (which can express muti and hypergraphs).
Linear Algebra is how almost all academic graph theory is expressed, and large chunks of machine learning and AI research are expressed in this language as well. There was recent thread here about PageRank and how it's really an eigenvector problem over a matrix, and the reality is, all graphs are matrices, they're typically sparse ones.
One question you might ask is, why would I do this? Why not just write my graph algorithms as a function that traverses nodes and edges? And one of the big answers is, parallelism. How are you going to do it? Fork a thread at each edge? Use a thread pool? What if you want to do it on CUDA too? Now you have many problems. How do you know how to efficiently schedule work? By treating graph traversal as a matrix multiplication, you just say Ax = b, and let the library figure it out on the specific hardware you want to target.
Here for example is a recent question on the NetworkX repo for how to find the boundary of a triangular mesh, it's one single line of GraphBLAS if you consider the graph as a matrix:
https://github.com/networkx/networkx/discussions/7326
This brings a very powerful language to the table, Linear Algebra. A language spoken by every scientist, engineer, mathematician and researcher on the planet. By treating graphs like matrices graph algorithms become expressible as mathematical formulas. For example, neural networks are graphs of adjacent layers, and the operation used to traverse from layer to layer is matrix multiplication. This generalizes to all matrices.
There is a lot of very new and powerful research and development going on around sparse graphs with linear algebra in the GraphBLAS API standard, and it's best reference implementation, SuiteSparse:GraphBLAS:
https://github.com/DrTimothyAldenDavis/GraphBLAS
SuiteSparse provides a highly optimized, parallel and CPU/GPU supported sparse Matrix Multiplication. This is relevant because traversing graph edges IS matrix multiplication when you realize that graphs are matrices.
Recently NetworkX has grown the ability to have different "graph engine" backends, and one of the first to be developed uses the python-graphblas library that binds to SuiteSparse. I'm not a directly contributor to that particular work but as I understand it there has been great results.
-
Build the dependency graph of your BigQuery pipelines at no cost: a Python implementation
In the project we used Python lib networkx and a DiGraph object (Direct Graph). To detect a table reference in a Query, we use sqlglot, a SQL parser (among other things) that works well with Bigquery.
- NetworkX – Network Analysis in Python
-
Custom libraries and utility tools for challenges
If you program in Python, can use NetworkX for that. But it's probably a good idea to implement the basic algorithms yourself at least one time.
-
Google open-sources their graph mining library
For those wanting to play with graphs and ML I was browsing the arangodb docs recently and I saw that it includes integrations to various graph libraries and machine learning frameworks [1]. I also saw a few jupyter notebooks dealing with machine learning from graphs [2].
Integrations include:
* NetworkX -- https://networkx.org/
* DeepGraphLibrary -- https://www.dgl.ai/
* cuGraph (Rapids.ai Graph) -- https://docs.rapids.ai/api/cugraph/stable/
* PyG (PyTorch Geometric) -- https://pytorch-geometric.readthedocs.io/en/latest/
--
1: https://docs.arangodb.com/3.11/data-science/adapters/
2: https://github.com/arangodb/interactive_tutorials#machine-le...
-
org-roam-pygraph: Build a graph of your org-roam collection for use in Python
org-roam-ui is a great interactive visualization tool, but its main use is visualization. The hope of this library is that it could be part of a larger graph analysis pipeline. The demo provides an example graph visualization, but what you choose to do with the resulting graph certainly isn't limited to that. See for example networkx.
What are some alternatives?
glue - Linked Data Visualizations Across Multiple Files
Numba - NumPy aware dynamic Python compiler using LLVM
Pandas - Flexible and powerful data analysis / manipulation library for Python, providing labeled data structures similar to R data.frame objects, statistical functions, and much more
Dask - Parallel computing with task scheduling
RDKit - The official sources for the RDKit library
julia - The Julia Programming Language
Airflow - Apache Airflow - A platform to programmatically author, schedule, and monitor workflows
Interactive Parallel Computing with IPython - IPython Parallel: Interactive Parallel Computing in Python
snap - Stanford Network Analysis Platform (SNAP) is a general purpose network analysis and graph mining library.
NumPy - The fundamental package for scientific computing with Python.
SymPy - A computer algebra system written in pure Python