[B! graph] InoHiroã®ãƒ–ãƒƒã‚¯ãƒžãƒ¼ã‚¯

InoHiro id:InoHiro

graphã«é–¢ã™ã‚‹InoHiroã®ãƒ–ãƒƒã‚¯ãƒžãƒ¼ã‚¯ (57)

${{author_name}}$

{{{comment_expanded}}}

{{label}}

{{#is_bookmark}}ãƒªã‚¹ãƒˆ{{/is_bookmark}}{{^is_bookmark}}ãƒªãƒ³ã‚¯{{/is_bookmark}}

${{author_name}}$
{{author_name}}{{created}}
{{ #comment }}{{ comment }}{{ /comment }}
- {{ label }}

${{author_name}}$

{{{comment_expanded}}}

{{label}}

{{#is_bookmark}}ãƒªã‚¹ãƒˆ{{/is_bookmark}}{{^is_bookmark}}ãƒªãƒ³ã‚¯{{/is_bookmark}}

æ©Ÿã¯ç†Ÿã—ãŸï¼ã‚°ãƒ©ãƒ•æ§‹é€ ã«å¯¾ã™ã‚‹Deep Learningã€Graph Convolutionã®ã”ç´¹ä»‹ - ABEJA Tech Blog
ã¯ã˜ã‚ã¾ã—ã¦ã€‚ABEJAã§Researcherã‚’ã‚„ã‚‰ã›ã¦ã„ãŸã ã„ã¦ã„ã‚‹ç™½å·ã§ã™ã€‚ å…ˆæ—¥ã€åŒ–åˆç‰©ã®ç‰©æ€§æŽ¨å®šã‚’Deep Learningã‚’ã¤ã‹ã£ã¦å¾“æ¥æ‰‹æ³•ã‚ˆã‚Š300,000å€é«˜é€Ÿã«å‡¦ç†ã™ã‚‹ã¨ã„ã†è«–æ–‡ãŒã§ã¾ã—ãŸï¼ˆ[1], [2]ï¼‰ã€‚ã“ã®è«–æ–‡ã®æ‰‹æ³•ã¯ã€Graph Convolutionã¨ã„ã†ã‚°ãƒ©ãƒ•ä¸Šã«å®šç¾©ã•ã‚ŒãŸConvolutionæ¼”ç®—ãŒãƒ™ãƒ¼ã‚¹ã¨ãªã£ã¦ã„ã¾ã™ã€‚ç‰©æ€§æŽ¨å®šã«é™ã‚‰ãšã€ã‚°ãƒ©ãƒ•è§£æžå…¨èˆ¬ã‚’ Deep Learning ã§ä¸Šæ‰‹ã«ã“ãªã›ã‚‹ã‚ˆã†ã«ãªã‚Œã°ã€Deep Learningã®ã‚¢ãƒ—ãƒªã‚±ãƒ¼ã‚·ãƒ§ãƒ³ã®å¹…ãŒãã£ã¨æ‹¡ãŒã‚Šã€ã•ã‚‰ãªã‚‹ã‚¤ãƒŽãƒ™ãƒ¼ã‚·ãƒ§ãƒ³ãŒèµ·ããã†ãªäºˆæ„ŸãŒã—ã¾ã™ã€‚ ICMLã‚„NIPSãªã©ã®æ©Ÿæ¢°å¦ç¿’ç³»ã®ä¸»è¦å›½éš›ä¼šè°ã§ã‚‚æ•°å¹´å‰ã‹ã‚‰Graph Convolutionã«ã¤ã„ã¦ã®è«–æ–‡ãŒã¡ã‚‰ã»ã‚‰å‡ºç¾ã—ã¯ã˜ã‚ã¦ãŠã‚Šã€ã¨ãã«æœ€è¿‘ãã®å‹¢ã„ãŒå¢—ã—ã¦ãã¦ã„ã‚‹å°è±¡ãŒã‚ã‚Šã¾ã™ã€‚å€‹äººçš„ã«ã‚‚æœ€è¿‘ï¼ˆå‰ã‹ã‚‰ï¼Ÿï¼‰ã«ã‚ã‹ã«ã‚°ãƒ©ãƒ•ã¥ã„ã¦ã„
InoHiro 2017/04/28
deep_learning

graph
ãƒªãƒ³ã‚¯
Vizceral Open Source
Previously we wrote about our traffic intuition tool, Flux. We have some announcements and updates to share about this project. First, we have renamed the project to Vizceral. More importantly, Vizceral is now open source! Open SourceVizceral transf ormed the way we understand and digest information about the state of traffic flowing into the Netflix control plane. We wanted to be able to intuit de
InoHiro 2016/08/04
100% JS ã ã£ãŸ

graph

Visualization
ãƒªãƒ³ã‚¯
Caveman Graph -- from Wolfram MathWorld
The (connected) caveman graph is a graph arising in social network theory formed by modifying a set of isolated -cliques (or "caves") by removing one edge from each clique and using it to connect to a neighboring clique along a central cycle such that all cliques form a single unbroken loop (Watts 1999). A number of cavemen graphs formed in this manner from are illustrated above. Caveman graphs ar
InoHiro 2015/09/09
graph
ãƒªãƒ³ã‚¯
ãƒ“ãƒƒã‚°ãƒ‡ãƒ¼ã‚¿æŠ€è¡“ã‚’ç”¨ã„ãŸã‚°ãƒ©ãƒ•å‡¦ç†
ã‚ãªãŸã«ã¨ã£ã¦é‡è¦ãªãƒˆãƒ”ãƒƒã‚¯ã‚„åŒåƒšã®æœ€æ–°æƒ…å ±ã‚’å…¥æ‰‹ã—ã¾ã—ã‚‡ã†æœ€æ–°ã®æ´žå¯Ÿã¨ãƒˆãƒ¬ãƒ³ãƒ‰ã«é–¢ã™ã‚‹æœ€æ–°æƒ…å ±ã‚’å³åº§ã«å—ã‘å–ã‚Šã¾ã—ã‚‡ã†ã€‚ ç¶™ç¶šçš„ãªå¦ç¿’ã®ãŸã‚ã«ã€ç„¡æ–™ã®ãƒªã‚½ãƒ¼ã‚¹ã«æ‰‹è»½ã«ã‚¢ã‚¯ã‚»ã‚¹ã—ã¾ã—ã‚‡ã†ãƒŸãƒ‹ãƒ–ãƒƒã‚¯ã€ãƒˆãƒ©ãƒ³ã‚¹ã‚¯ãƒªãƒ—ãƒˆä»˜ãå‹•ç”»ã€ãŠã‚ˆã³ãƒˆãƒ¬ãƒ¼ãƒ‹ãƒ³ã‚°æ•™æã€‚ è¨˜äº‹ã‚’ä¿å˜ã—ã¦ã€ã„ã¤ã§ã‚‚èªã‚€ã“ã¨ãŒã§ãã¾ã™è¨˜äº‹ã‚’ãƒ–ãƒƒã‚¯ãƒžãƒ¼ã‚¯ã—ã¦ã€æº–å‚™ãŒã§ããŸã‚‰ã„ã¤ã§ã‚‚èªã‚ã¾ã™ã€‚
InoHiro 2015/08/21
graph
ãƒªãƒ³ã‚¯
GitHub - thinkaurelius/titan: Distributed Graph Database
You signed in with another tab or window. Reload to refresh your session. You signed out in another tab or window. Reload to refresh your session. You switched accounts on another tab or window. Reload to refresh your session. Dismiss alert
InoHiro 2015/08/21
titan

graph
ãƒªãƒ³ã‚¯
Graph Computing Framework | Apache TinkerPop
Gremlin Query Language Gremlin is the graph traversal language of Apache TinkerPop. Gremlin is a functional, data-flow language that enables users to succinctly express complex traversals on (or queries of) their application's property graph. Every Gremlin traversal is composed of a sequence of (potentially nested) steps.
InoHiro 2015/08/21
graph
ãƒªãƒ³ã‚¯
New â€“ Store and Process Graph Data using the DynamoDB Storage Backend for Titan | Amazon Web Services
AWS News Blog New â€“ Store and Process Graph Data using the DynamoDB Storage Backend for Titan Graph databases elegantly and efficiently represent entities (generally known as vertices or nodes) and relationships (edges) that connect them. Hereâ€™s a very simple example of a graph: Bill and Candace have a daughter named Janet, and she has a son named Bob. This makes Candace Bobâ€™s grandmother, and Bil
InoHiro 2015/08/21
graph

AWS

titan
ãƒªãƒ³ã‚¯
Performance Comparison - graph-tool: Efficent network analysis with python
Graph-tool performance comparison This page shows a succinct performance comparison between graph-tool and two other popular graph libraries with Python bindings, igraph and NetworkX. NetworkX is a pure-python implementation, whereas igraph is implemented in C. Here we select a few representative algorithms which are implemented in all three libraries, and test them on the same graph. The graph us
InoHiro 2015/05/11
graph

python
ãƒªãƒ³ã‚¯
Facebook
å¥½ããªã“ã¨ã‚’ãƒã‚§ãƒƒã‚¯ã—ã‚ˆã†ã€‚Facebookã«ãƒã‚°ã‚¤ãƒ³ãƒ¡ãƒ¼ãƒ«ã‚¢ãƒ‰ãƒ¬ã‚¹ã¾ãŸã¯æºå¸¯é›»è©±ç•ªå·ãƒ‘ã‚¹ãƒ¯ãƒ¼ãƒ‰ãƒã‚°ã‚¤ãƒ³ãƒ‘ã‚¹ãƒ¯ãƒ¼ãƒ‰ã‚’å¿˜ã‚ŒãŸå ´åˆæ–°ã—ã„ã‚¢ã‚«ã‚¦ãƒ³ãƒˆã‚’ä½œæˆ æ—¥æœ¬èªžEnglish (US)PortuguÃªs (Brasil)ä¸æ–‡(ç®€ä½“)Tiáº¿ng Viá»‡tEspaÃ±olBahasa Indonesiaãã®ä»–ã®è¨€èªžâ€¦ã‚¢ã‚«ã‚¦ãƒ³ãƒˆç™»éŒ²ãƒã‚°ã‚¤ãƒ³MessengerFacebook Liteå‹•ç”»Meta PayMetaã‚¹ãƒˆã‚¢Meta QuestRay-Ban MetaMeta AIInstagramThreadsæŠ•ç¥¨æƒ…å ±ã‚»ãƒ³ã‚¿ãƒ¼ãƒ—ãƒ©ã‚¤ãƒã‚·ãƒ¼ãƒãƒªã‚·ãƒ¼ãƒ—ãƒ©ã‚¤ãƒã‚·ãƒ¼ã‚»ãƒ³ã‚¿ãƒ¼Facebookã«ã¤ã„ã¦åºƒå‘Šã‚’ä½œæˆãƒšãƒ¼ã‚¸ã‚’ä½œæˆé–‹ç™ºè€…æŽ¡ç”¨æƒ…å ±CookieAdChoicesåˆ©ç”¨è¦ç´„ãƒ˜ãƒ«ãƒ—é€£çµ¡å…ˆã®ã‚¢ãƒƒãƒ—ãƒãƒ¼ãƒ‰ã¨éžãƒ¦ãƒ¼ã‚¶ãƒ¼Meta Â© 2026
InoHiro 2014/01/08
facebook

socialgraph

graph

benchmark
ãƒªãƒ³ã‚¯
ã‚°ãƒ©ãƒ•DBã®Neo4jã‚’1æ—¥è§¦ã£ã¦ã¿ãŸ - Wantedly Engineer Blog
ã“ã‚“ã«ã¡ã¯ï¼Wantedlyã§12æœˆä¸ã«ã‚¤ãƒ³ã‚¿ãƒ¼ãƒ³ã‚·ãƒƒãƒ—ã‚’ã—ã¦ã„ãŸå¾Œè—¤ã§ã™ï¼Ž ä»Šå›žï¼Œæ¥å‹™ã®ä¸€ç’°ã¨ã—ã¦ã‚°ãƒ©ãƒ•DBã§ã‚ã‚‹Neo4jã‚’1æ—¥è§¦ã£ã¦ã¿ãŸã®ã§ï¼Œãã‚Œã«é–¢ã—ã¦ã¤ã‚‰ã¤ã‚‰æ›¸ã„ã¦ã¿ãŸã„ã¨æ€ã„ã¾ã™ï¼Ž Neo4jã£ã¦ï¼Ÿ Neo4jã¯ã‚°ãƒ©ãƒ•DBï¼ˆãƒ‡ãƒ¼ã‚¿ã®æ§‹é€ ãŒå…¨ã¦ã‚°ãƒ©ãƒ•æ§‹é€ ã§è¡¨ã•ã‚Œã‚‹DBï¼‰ã®1ã¤ã§ã™ï¼Ž Javaã§å®Ÿè£…ã•ã‚Œã¦ãŠã‚Šï¼Œã‚ªãƒ¼ãƒ—ãƒ³ã‚½ãƒ¼ã‚¹ã¨ã—ã¦å…¬é–‹ãƒ»é–‹ç™ºãŒé€²ã‚ã‚‰ã‚Œã¦ã„ã¾ã™ï¼Ž Neo4jå…¬å¼ ã‚°ãƒ©ãƒ•DBã®ä½ç½®ä»˜ã‘ï¼ŒåŠã³ãã®æ€§è³ªã«é–¢ã—ã¦ã¯æ¬¡ã®è¨˜äº‹ãŒåˆ†ã‹ã‚Šã‚„ã™ã„ã§ã—ã‚‡ã†ã‹ï¼Ž SQLã‹NoSQLã‹ã¨ã„ã†åˆ†é¡žã ã¨å‹¿è«–NoSQLã«åˆ†é¡žã•ã‚Œã¾ã™ï¼ŽãŒï¼ŒKey-Valueåž‹ã‚„ãƒ‰ã‚ãƒ¥ãƒ¡ãƒ³ãƒˆæŒ‡å‘ã®ã‚‚ã®ã¨ã¯ã¾ãŸç•°ãªã‚Šã¾ã™ï¼Ž InfoQ ã‚°ãƒ©ãƒ•ãƒ‡ãƒ¼ã‚¿ãƒ™ãƒ¼ã‚¹ã€NOSQLã€Neo4j RDBã‚„Key-Valueåž‹ã®DBãªã©ï¼Œä»–ã®ã‚¿ã‚¤ãƒ—ã®DBã¨ã®æ¯”è¼ƒã«ã¤ã„ã¦ã¯å…¬å¼ãƒžãƒ‹ãƒ¥ã‚¢ãƒ«ã«ç°¡å˜ã«ã¾ã¨ã‚ã‚‰ã‚Œã¦ã„ã¾ã™ï¼Ž 2.2. Compari
InoHiro 2014/01/08
graph

graphdb

neo4j
ãƒªãƒ³ã‚¯
SNAP: Stanford Network Analysis Project
We are inviting applications for postdoctoral positions in Foundation Models for Biomedicine. We have open positions for undergraduate and graduate research assistants. The application form and project descriptions can be found here. SNAP for C++: Stanford Network Analysis Platform Stanford Network Analysis Platform (SNAP) is a general purpose network analysis and graph mining library. It is writt
InoHiro 2013/12/18
graph

dataset
ãƒªãƒ³ã‚¯
Lowest common ancestor - Wikipedia
In this tree, the lowest common ancestor of the nodes x and y is marked in dark green. Other common ancestors are shown in light green. In graph theory and computer science, the lowest common ancestor (LCA) (also called least common ancestor) of two nodes v and w in a tree or directed acyclic graph (DAG) T is the lowest (i.e. deepest) node that has both v and w as descendants, where we define each
InoHiro 2013/10/30
graph

algorithm
ãƒªãƒ³ã‚¯
LCA(Lowest Common Ancestor) - tomiflu's blog
InoHiro 2013/10/30
tree

algorithm

graph
ãƒªãƒ³ã‚¯
ALENEX'14 ã«è«–æ–‡æŽ¡æŠž - iwiwiã®æ—¥è¨˜
å›½éš›å¦ä¼š ALENEX 2014 ã«è«–æ–‡ãŒæŽ¡æŠžã•ã‚Œã¾ã—ãŸï¼ŽALENEX (Meeting on Algorithm Engineering & Experiments) ã¯ SIAM ã«ã‚ˆã£ã¦é–‹å‚¬ã•ã‚Œã‚‹å®Ÿé¨“ç³»ã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ (experimental algorithmics) ã‚’æ‰±ã†æœ€ã‚‚æœ‰åãªä¼šè°ã® 1 ã¤ã§ï¼Œç†è«–ç³»ã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ ã®ãƒˆãƒƒãƒ—å¦ä¼š SODA (Symposium on Discrete Algorithms) ã«ä½µè¨ã—ã¦é–‹å‚¬ã•ã‚Œã¾ã™ï¼Žç™ºè¡¨ã¯æ¥å¹´ã® 1 æœˆã«ã‚¢ãƒ¡ãƒªã‚«ã®ã‚ªãƒ¬ã‚´ãƒ³ã§ã™ï¼Ž ä»Šå›žã®è«–æ–‡ã¯ "Fast Shortest-path Distance Queries on Road Networks by Pruned Highway Labeling" ã¨ã„ã†ã‚¿ã‚¤ãƒˆãƒ«ã§ï¼Œç ”ç©¶å®¤ã®å¾Œè¼©ã®æ²³ç”°å›ï¼ŒåŒæœŸã®å²©ç”°ï¼ŒNII ã®æ²³åŽŸæž—å…ˆç”Ÿã¨ã®å…±è‘—ã§ã™ï¼Žã‚¿ã‚¤ãƒˆãƒ«ã‹ã‚‰ã”å¯Ÿã—ã®é€šã‚Šï¼ŒSIGMOD'
InoHiro 2013/10/30
ãŠã‚ã§ã¨ã†ã”ã–ã„ã¾ã™ï¼ã™ã”ã™ãŽã‚‹...

graph

research
ãƒªãƒ³ã‚¯
Small-world network - Wikipedia
A small-world network is a graph characterized by a high clustering coefficient and low distances. In an example of a social network, high clustering implies the high probability that two friends of one person are friends themselves. The low distances, on the other hand, mean that there is a short chain of social connections between any two people (this effect is known as six degrees of separation
InoHiro 2013/09/25
network

graph

wikipedia
ãƒªãƒ³ã‚¯
Sigma.js
Architecture Sigma.js is a modern JavaScript library for rendering and interacting with network graphs in the browser. It works in symbiosis with graphology, a multipurpose graph manipulation library.
InoHiro 2013/09/25
JavaScript

Visualization

graph
ãƒªãƒ³ã‚¯
Graph canonization - Wikipedia
InoHiro 2013/09/10
wikipedia

graph
ãƒªãƒ³ã‚¯
Cut (graph theory) - Wikipedia
InoHiro 2013/07/04
wikipedia

graph
ãƒªãƒ³ã‚¯
Graph Databases, published by O'Reilly Media
O'Reilly Graph Databases The Definitive Book of Graph Databases. Download your FREE copy Discover how graph databases can help you manage and query highly connected data. With this practical book, youâ€™ll learn how to design and implement a graph database that brings the power of graphs to bear on a broad range of probl em domains. Whether you want to speed up your response to user queries or build
InoHiro 2013/06/07
graph

book

graphdb
ãƒªãƒ³ã‚¯
ãƒ™ã‚¯ãƒˆãƒ«ã«ãƒ©ãƒ—ãƒ©ã‚·ã‚¢ãƒ³è¡Œåˆ—ã‚’æŽ›ã‘ã¦ã¿ã‚‹ - malibu-bulldogã®æ—¥è¨˜
ã“ã“æ•°æ—¥ã§ãƒ©ãƒ—ãƒ©ã‚·ã‚¢ãƒ³è¡Œåˆ—ã«ã¤ã„ã¦å‹‰å¼·ã—ãŸã“ã¨ ã‚°ãƒ©ãƒ• ã‚°ãƒ©ãƒ•ã¯G (V , E) ã¨å®šç¾©ã•ã‚Œã¾ã™ã€‚ ã“ã®æ™‚ã€Vã¯ã‚°ãƒ©ãƒ•ã‚’æ§‹æˆã™ã‚‹ç‚¹ã®é›†åˆã§ã€Eã¯ç‚¹ã®é€£çµæƒ…å ±ã€‚ Eã¯è¾ºã¨ã‚ˆã°ã‚Œã¾ã™ãã€‚ ç‚¹ã«é–¢ã—ã¦ã¯ä¸€æ„ãªæ•´æ•°ã‚’ä»˜ã‘ã¦ã‚ã’ã‚‹ã®ãŒæ™®é€šã¿ãŸã„ã§ã™ãã€‚ ã“ã®è¾ºã«ã‚‚ã—å‘ããŒã‚ã‚‹ãªã‚‰ã€ä¾‹ãˆã°ï¼‘â†’ï¼’ã¯ã„ã‘ã‚‹ã‘ã©ãã®é€†ã®ï¼’â†’ï¼‘ã¯ãƒ€ãƒ¡ã¨ã‹ã€æœ‰å‘ã‚°ãƒ©ãƒ•ã¨å‘¼ã³ã¾ã™ã€‚ ãã†ã„ã†å‘ããŒãªã„ãªã‚‰ç„¡å‘ã‚°ãƒ©ãƒ•ã¨å‘¼ã³ã¾ã™ã€‚ ä¾‹ãˆã°ã€Webã®ãƒªãƒ³ã‚¯æ§‹é€ ã‚’å˜ç´”ã«è€ƒãˆã‚‹ãªã‚‰å‘ããŒé–¢ä¿‚ã‚ã‚‹ã®ã§æœ‰å‘ã‚°ãƒ©ãƒ•ã§ã™ãã€‚ éš£æŽ¥ã‚°ãƒ©ãƒ• ã‚°ãƒ©ãƒ•Gã«å¯¾ã—ã¦ç‚¹ã®ç·æ•°ã‚’Nã¨ã—ã¾ã™ã€‚NÃ—Nã®è¡Œåˆ—ã‚’ä½œã‚Šã€ãã®i,jæˆåˆ†ã‚’è¾ºã®ã‚ã‚‹ç„¡ã—ã§ï¼‘ã‹ï¼ã‚’ä»£å…¥ã—ã¦ã‚ã’ã‚‹ã¨éš£æŽ¥ã‚°ãƒ©ãƒ•ã«ãªã‚Šã¾ã™ã€‚ å¯¾è§’æˆåˆ†ã¯æ™®é€šãªã‚‰ï¼ã‚’ã„ã‚Œã¾ã™ã€‚ ä¾‹ãˆã°ã€ï¼‘ã€ï¼’ã€ï¼“ã¨ã„ã†ä¸‰ã¤ã®ç‚¹ã¨ï¼‘ãƒ¼ï¼’ã€ï¼’ãƒ¼ï¼“ã®ãµãŸã¤ã®è¾ºã‹ã‚‰ãªã‚‹ã‚°ãƒ©ãƒ•ã¯ 0 1 0 1 0 1 0 1 0 ã¨æ›¸ã‘ã¾ã™ã€‚ ã¡ãªã¿ã«ã€ä¾‹ãˆ
InoHiro 2013/05/29
vector

graph
ãƒªãƒ³ã‚¯
1 2 3 æ¬¡ã®ãƒšãƒ¼ã‚¸