14 Matching Annotations
  1. Dec 2020
    1. introduction and in its summary at the end: “a graph of data intended to accumulate and convey knowledge of the real world, whose nodes represent entities of interest and whose edges represent relations between these entities”. We

      comprehensive definition

    2. but these same vendors were also talking about Semantic Web and Linked Data capabilities before that, so I thought that they were just rebranding with the new buzz phrase as a marketing strategy.

      Maybe the vendor dependency is one of the problems.

  2. Jul 2020
  3. Apr 2020
    1. Graphically, interactions can be seen as non-parallel lines connecting means when we are working with the simple two-factor 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

  4. Feb 2020
  5. Apr 2019
  6. Jan 2019
    1. Explanatory Graphs for CNNs

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

  7. Dec 2018
    1. Inflation-adjusted Textbook Pain Multiplier for Decision-Makers

      Analysis and solutions to better convey the economic impact of rising textbook costs.

  8. Nov 2018
    1. 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 depth-first search. If no cycles are found, that means the services' dependencies can be represented by a DAG (directed acyclic graph).
    1. 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?

    Tags

    Annotators

  9. Oct 2017
  10. Jan 2017
  11. Feb 2015