12 Matching Annotations
 Jul 2020

www.slideshare.net www.slideshare.net


Cazabet, R., Boudebza, S., & Rossetti, G. (2020). Evaluating Community Detection Algorithms for Progressively Evolving Graphs. ArXiv:2007.08635 [Physics]. http://arxiv.org/abs/2007.08635

 Apr 2020

online.stat.psu.edu online.stat.psu.edu

Graphically, interactions can be seen as nonparallel lines connecting means when we are working with the simple twofactor factorial with 2 levels of each main effect (adapted from Zar, H. Biostatistical Analysis, 5th Ed., 1999). Remember interactions are referring to the failure of a response variable to one factor to be the same at different levels of another factor. So when lines are parallel the response is the same. In the plots below you will see parallel lines as a consistent feature in all of the plots with no interaction. In plots depicting interactions, you notice that the lines cross (or would cross if the lines kept going).
Main and interaction effects  graphs

 Feb 2020

www.coreecon.org www.coreecon.org

Figure 1.16
Note the dramatic inconsistency of the scale on the left hand side. What is going on here?

 Apr 2019


pretty great intro to knowledge graphs

 Jan 2019

iphysresearch.github.io iphysresearch.github.io

Explanatory Graphs for CNNs
Q Zhang 在知乎上亲自解答关于 Explanatory Graphs 的技术细节和研究理念~ http://t.cn/EqfQbAW [赞]
Tags
Annotators
URL

 Dec 2018

mathematikoi.net mathematikoi.net

Inflationadjusted Textbook Pain Multiplier for DecisionMakers
Analysis and solutions to better convey the economic impact of rising textbook costs.
Tags
Annotators
URL

 Nov 2018


One way to identify cycles is to build a dependency graph representing all services in the system and all RPCs exchanged among them. Begin building the graph by putting each service on a node of the graph and drawing directed edges to represent the outgoing RPCs. Once all services are placed in the graph, the existing dependency cycles can be identified using common algorithms such as finding a topological sorting via a depthfirst search. If no cycles are found, that means the services' dependencies can be represented by a DAG (directed acyclic graph).
Tags
Annotators
URL


Local file Local file

Creating KGs is not trivial.
This applies to universal KG in particular. Domain specific KGs can have any level of complexity  can they still be called knowledge graphs then?

 Oct 2017

tedunderwood.com tedunderwood.com

Network graphs that connect characters are fun to explore for a similar reason.

 Jan 2017
 Feb 2015

wiki.chn.io wiki.chn.io

Num / Num summarizes a graph with nodes / arcs.
The underlying graph model is not explicitly mentionned here nor in the README of the plugin.
