Papers Search - Revision history

BPeat at 14:04, 28 April 2024

2024-04-28T14:04:43Z

BPeat at 11:53, 17 August 2023

2023-08-17T11:53:06Z

BPeat at 20:17, 28 April 2023

2023-04-28T20:17:54Z

BPeat: /* Zettelkasten ('slip box') */

2022-03-20T14:53:17Z

‎Zettelkasten ('slip box')

BPeat: /* Zettelkasten ('slip box') */

2022-03-20T14:50:56Z

‎Zettelkasten ('slip box')

BPeat: /* Zettelkasten ('slip box') */

2022-03-20T14:49:17Z

‎Zettelkasten ('slip box')

BPeat: /* Zettelkasten ('slip box') */

2022-03-20T14:48:40Z

‎Zettelkasten ('slip box')

BPeat: /* Zettelkasten ('slip box') */

2022-03-20T14:46:38Z

‎Zettelkasten ('slip box')

BPeat: /* Zettelkasten ('slip box') */

2022-03-20T14:45:37Z

‎Zettelkasten ('slip box')

BPeat: /* Zettelkasten ('slip box') */

2022-03-20T14:41:01Z

‎Zettelkasten ('slip box')

@@ Line 95: / Line 95: @@
 * [http://takesmartnotes.com/ "How to Take Smart Notes" | Sonke Ahrens]
 * Tools:
-** [[Wikis]]
+** [[Wiki]]
 ** [http://obsidian.md/ Obsidian]  ... a knowledge base on top of a local folder of plain text Markdown files
 ** [http://www.notion.so/desktop Notion] ... customize to work the way you want it to. just drag and drop to craft the dashboard, website, doc, or system you need

@@ Line 44: / Line 44: @@
 In the [[graph]], papers are arranged according to their similarity. That means that even papers that do not directly cite each other can be strongly connected and very closely positioned. Connected Papers is not a citation tree.
-Our similarity metric is based on the concepts of Co-citation and Bibliographic Coupling. According to this measure, two papers that have highly overlapping citations and references are presumed to have a higher chance of treating a related subject matter.  Our algorithm then builds a Force Directed [[Graph]] to distribute the papers in a way that visually clusters similar papers together and pushes less similar papers away from each other. Upon node selection we highlight the shortest path from each node to the origin paper in similarity space.  Our database is connected to the Semantic Scholar Paper Corpus (licensed under ODC-BY). Their team has done an amazing job of compiling hundreds of millions of published papers across many scientific fields.
+Our similarity metric is based on the concepts of Co-citation and Bibliographic Coupling. According to this measure, two papers that have highly overlapping citations and references are presumed to have a higher chance of treating a related subject matter.  Our algorithm then builds a Force Directed [[Graph]] to distribute the papers in a way that visually clusters similar papers together and pushes less similar papers away from each other. Upon node selection we highlight the shortest path from each node to the origin paper in similarity space.  Our [[database]] is connected to the Semantic Scholar Paper Corpus (licensed under ODC-BY). Their team has done an amazing job of compiling hundreds of millions of published papers across many scientific fields.
 <youtube>cA793vs92bc</youtube>
@@ Line 99: / Line 99: @@
 ** [http://www.notion.so/desktop Notion] ... customize to work the way you want it to. just drag and drop to craft the dashboard, website, doc, or system you need
 ** [http://foambubble.github.io/foam/ Foam] ... personal knowledge management and sharing system, built on [[Microsoft]] [http://code.visualstudio.com/ Visual Studio Code] and [http://github.com/ GitHub]
-** [http://roamresearch.com/ Roam] ... for networked thought; as easy to use as a document. As powerful as a graph database
+** [http://roamresearch.com/ Roam] ... for networked thought; as easy to use as a document. As powerful as a [[graph]] [[database]]

@@ Line 8: / Line 8: @@
 [http://www.google.com/search?q=Semantic+Research+academic+Papers+connected+citation+Allen+Institute ...Google search]
-* [[Natural Language Tools & Services]]
+* [[Large Language Model (LLM)]] ... [[Natural Language Processing (NLP)]]  ...[[Natural Language Generation (NLG)|Generation]] ... [[Natural Language Classification (NLC)|Classification]] ...  [[Natural Language Processing (NLP)#Natural Language Understanding (NLU)|Understanding]] ... [[Language Translation|Translation]] ... [[Natural Language Tools & Services|Tools & Services]]
 * [[Google Semantic Reactor]] ... a tool for experimenting with [[Natural Language Processing (NLP) | natural language understanding (NLU)]] models via a [[Google Sheets]] add-on

@@ Line 101: / Line 101: @@
 ** [http://roamresearch.com/ Roam] ... for networked thought; as easy to use as a document. As powerful as a graph database
 is a collection of notes on paper slips with a special twist: It is a hypertext that he could navigate the drawer cabinet containing all the paper slips with a reasonable amount of time and energy.
 <youtube>L9SLlxaEEXY</youtube>

@@ Line 99: / Line 99: @@
 ** [http://www.notion.so/desktop Notion] ... customize to work the way you want it to. just drag and drop to craft the dashboard, website, doc, or system you need
 ** [http://foambubble.github.io/foam/ Foam] ... personal knowledge management and sharing system, built on [[Microsoft]] [http://code.visualstudio.com/ Visual Studio Code] and [http://github.com/ GitHub]
-** [http://roamresearch.com/ Roam]
+** [http://roamresearch.com/ Roam] ... for networked thought; as easy to use as a document. As powerful as a graph database
 is a collection of notes on paper slips with a special twist: It is a hypertext that he could navigate the drawer cabinet containing all the paper slips with a reasonable amount of time and energy.
 <youtube>L9SLlxaEEXY</youtube>