NLP コロキウム https://nlp-colloquium-jp.github.io/ で発表した際のスライドです。 論文: https://arxiv.org/abs/2205.01954 GitHub: https://github.com/joisino/wordtour 概要 単語埋め込みは現代の自然言語処理の中核技術のひとつで、文書分類や類似度測定をはじめとして、さまざまな場面で使用されていることは知っての通りです。しかし、ふつう埋め込み先は何百という高次元であり、使用する時には多くの時間やメモリを消費するうえに、高次元埋め込みを視覚的に表現できないため解釈が難しいことが問題です。そこで本研究では、【一次元】の単語埋め込みを教師なしで得る方法を提案します。とはいえ、単語のあらゆる側面を一次元で捉えるのは不可能であるので、本研究ではまず単語埋め込みが満たすべき性質を健全性と完
Session: Internet Economics & Monetization 1 * Machine Learning in an Auction Environment Patrick Hummel & R. Preston McAfee (Google Inc.) * Optimal Revenue-Sharing Double Auctions with Applications to Ad Exchanges Renato Gomes (Toulouse School of Economics) & Vahab Mirrokni (Google Research) Session: The Future * Exploring the Filter Bubble: The Effect of Using Recommender Systems on Content Dive
The document provides an overview of the activity feeds architecture. It discusses the fundamental entities of connections and activities. Connections express relationships between entities and are implemented as a directed graph. Activities form a log of actions by entities. To populate feeds, activities are copied and distributed to relevant entities and then aggregated. The aggregation process
This document discusses machine learning concepts including algorithms, data inputs/outputs, runtimes, and trends in academia vs industry. It notes that while academia focuses on algorithm complexity, industry prioritizes data-driven approaches using large datasets. Ensemble methods combining many simple models generally perform better than single complex models. Specific ML techniques discussed i
A graph is a structure composed of a set of vertices (i.e.~nodes, dots) connected to one another by a set of edges (i.e.~links, lines). The concept of a graph has been around since the late 19th century, however, only in recent decades has there been a strong resurgence in the development of both graph theories and applications. In applied computing, since the late 1960s, the interlinked table str
1) The document discusses query suggestion techniques using hitting time on graphs to model relationships between queries, reformulations, and URLs. 2) It presents algorithms for calculating the hitting time between nodes in a graph and using this to determine the likelihood of queries and URLs being related. 3) Experimental results on benchmark datasets show the hitting time approach achieves goo
Hadoop YARN | Hadoop YARN Architecture | Hadoop YARN Tutorial | Hadoop Tutori...
cvpaper.challengeはコンピュータビジョン分野の今を映し、トレンドを創り出す挑戦です。論文サマリ・アイディア考案・議論・実装・論文投稿に取り組み、凡ゆる知識を共有しています。 http://xpaperchallenge.org/cv/ 本資料はxpaper.challengeの2020年末ワークショップとしてプレゼンした、研究効率化Tipsです。10研究室、200ページ超にわたるノウハウ詰め合わせです。
1. 論文紹介 Towards Effective Browsing of Large Scale Social Annotations Rui Li, Shenghua Bao, Ben Fei, Zhong Su, and Yong Yu Proceedings of the 16th international conference on World Wide Web (WWW2007) 伊東研 修士2年 百田信 3. 1. はじめに Social Annotationの普及 • Annotation: 注釈 • Social Annotation – Webコンテンツに対しAnnotation(注釈)を付け る – Annotationを公開し共有する – Tag, コメント, 日付, … – Social Annotationサービスの例 • 動画 YouTube • 画像 Fl
The document discusses setting up Hadoop on a multi-node cluster. It goes through steps such as installing Java, downloading and extracting Hadoop, configuring nodes, formatting the HDFS, and starting processes on all nodes. Commands are shown to check the Hadoop version, run examples, and view logs.Read less
リリース、障害情報などのサービスのお知らせ
最新の人気エントリーの配信
処理を実行中です
j次のブックマーク
k前のブックマーク
lあとで読む
eコメント一覧を開く
oページを開く