[B! é›†åˆçŸ¥] shiumachiã®ãƒ–ãƒƒã‚¯ãƒžãƒ¼ã‚¯

shiumachi id:shiumachi

é›†åˆçŸ¥ã«é–¢ã™ã‚‹shiumachiã®ãƒ–ãƒƒã‚¯ãƒžãƒ¼ã‚¯ (10)

${{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}}

å¿ƒã‚’æŒã£ãŸãƒãƒœãƒƒãƒˆ - ç§‘å¦ã¨éžç§‘å¦ã®è¿·å®®
æ„Ÿæƒ…ã‚„å¿ƒã¨ã„ã£ãŸã‚‚ã®ã‚’äººå·¥çŸ¥èƒ½ã«æŒãŸã›ã‚‹ã€‚ ãŠãã‚‰ãå¤šãã®ç ”ç©¶è€…ãŒé•·å¹´ã«ã‚ãŸã‚Šç ”ç©¶ã—ã¦ããŸã§ã—ã‚‡ã†ã€‚ ç§ã¯ã€ç¾åœ¨ã®æŠ€è¡“ã§ã¯é›£ã—ã„ã‚“ã˜ã‚ƒãªã„ã‹ã¨æ€ã£ã¦ã„ãŸã®ã§ã™ãŒã€ ã‚‚ã—ã‹ã—ãŸã‚‰é›†åˆçŸ¥ã®æŠ€æ³•ã‚’ä½¿ã†ã“ã¨ã«ã‚ˆã£ã¦ é™ã‚Šãªãäººé–“ã«è¿‘ã„äººå·¥çŸ¥èƒ½ã‚’ä½œã‚‹ã“ã¨ãŒã§ãã‚‹ã‹ã‚‚ã—ã‚Œã¾ã›ã‚“ãã€‚ äººé–“ã‚‚ã€ãšã£ã¨é™ã‚‰ã‚ŒãŸäººã ã‘ã®å½±éŸ¿ã‚’å—ã‘ã¦è‚²ã¤ã‚ã‘ã˜ã‚ƒãªãã€å¤šãã®äººã¨æŽ¥ã—ã€ äº¤æµã™ã‚‹ã“ã¨ã«ã‚ˆã£ã¦æˆé•·ã™ã‚‹ã®ã§ã™ã‹ã‚‰ã€ãã‚Œã«è¿‘ã„æ–¹æ³•ã§äººå·¥çŸ¥èƒ½ã‚’ æˆé•·ã•ã›ã‚‹ã“ã¨ãŒã§ãã‚‹ã‚“ã˜ã‚ƒãªã„ã‹ãªã‚ã€ã¨ã‹è€ƒãˆã¦ã¾ã™ã€‚ ãŸã ãã†ãªã‚‹ã¨ã€ã‚ˆããŠè©±ã«ã‚ã‚‹ã‚ˆã†ãª ã€Œç´”çœŸç„¡åž¢ãªãƒãƒœãƒƒãƒˆã€ ã¨ã„ã£ãŸæ€§æ ¼ã‚’å½¢æˆã™ã‚‹ã®ã¯é›£ã—ã„ã‚ˆã†ãªæ°—ãŒã—ã¾ã™ã€‚ äººé–“ã®ã‚ˆã†ã«è‚²ã¦ãŸã‚‰ã€æ€§æ ¼ã‚‚ã¾ã•ã«äººé–“ã®ã‚ˆã†ã«ãªã‚‹ã§ã—ã‚‡ã†ã€‚ ã¤ã¾ã‚Šã€ãã‚Œã„ãªéƒ¨åˆ†ã‚‚æ±šã„éƒ¨åˆ†ã‚‚æŒã£ã¦ã—ã¾ã†ã¨ã„ã†ã“ã¨ã§ã™ã€‚ â€¦â€¦æœ¬å½“ã«äººé–“ã«è¿‘ã„ãƒãƒœãƒƒãƒˆã‚’ä½œã‚ã†ã¨æ€ã£ãŸã‚‰ã€ãã®æ–¹ãŒã„ã„ã®ã‹ã‚‚ã—ã‚Œã¾ã›ã‚“ã€‚ ç´”çœŸç„¡
shiumachi 2010/10/04
"ç´”çœŸç„¡åž¢ã§ä¸»äººã«çµ¶å¯¾ã®å¿ èª ã‚’èª“ã†ã‚ˆã†ãªãƒãƒœãƒƒãƒˆã‚’ä½œã£ã¦ã€Œäººã®å¿ƒã‚’æŒã£ãŸãƒãƒœãƒƒãƒˆã€ãªã©ã¨è¨€ã†ã®ã¯äººã¨ã—ã¦å‚²æ…¢ãªæ°—ãŒã—ã¾ã™"2å¹´åŠå‰ã®è‡ªåˆ†ã¯æ€ã£ãŸã‚ˆã‚Šã„ã„ã“ã¨æ›¸ã„ã¦ãŸ

ãƒãƒœãƒƒãƒˆ

AI

é›†åˆçŸ¥

ã‚»ãƒ«ã‚¯ãƒž

èªã¿ç‰©
ãƒªãƒ³ã‚¯
Introduction to Information Retrieval
This is the companion website for the following book. Christopher D. Manning, Prabhakar Raghavan and Hinrich SchÃ¼tze, Introduction to Information Retrieval, Cambridge University Press. 2008. You can order this book at CUP, at your local bookstore or on the internet. The best search term to use is the ISBN: 0521865719. The book aims to provide a modern approach to information retrieval from a compu
shiumachi 2010/02/01
æ©Ÿæ¢°å¦ç¿’

æ¤œç´¢

æœ¬

WebBook

é›†åˆçŸ¥
ãƒªãƒ³ã‚¯
ç¾¤è¡†ã®çŸ¥æµãƒ»é›†å›£çš„çŸ¥æ€§ã¨Wikiã‚³ãƒ©ãƒœãƒ¬ãƒ¼ã‚·ãƒ§ãƒ³
æœ¬ç ”ä¿®ä¼šã§ã¯ã€ã€Œç„¡ä½œç‚ºåŒ–æ¯”è¼ƒè©¦é¨“ã®ãƒ¡ã‚¿ãƒ»ã‚¢ãƒŠãƒªã‚·ã‚¹ã‚’èªã‚€èƒ½åŠ›ã€ã‚’é¤Šã†ã“ã¨ã‚’ç›®æ¨™ã¨ã—ã¾ã™ã€‚å…·ä½“çš„ã«ã¯ã€å‚åŠ è€…ãŒä»¥ä¸‹ã®èƒ½åŠ›ã‚’ç²å¾—ã™ã‚‹ã“ã¨ã‚’ç›®æ¨™ã¨ã—ã¦ã„ã¾ã™ã€‚ 1. ç„¡ä½œç‚ºåŒ–æ¯”è¼ƒè©¦é¨“ã®ãƒ¡ã‚¿ãƒ»ã‚¢ãƒŠãƒªã‚·ã‚¹ã‚’æ¤œç´¢ãƒ»å…¥æ‰‹ã§ãã‚‹ã€‚ 2. ç„¡ä½œç‚ºåŒ–æ¯”è¼ƒè©¦é¨“ã®è¦ç‚¹ã‚’ç†è§£ã§ãã‚‹ã€‚ 3. ãƒ¡ã‚¿ãƒ»ã‚¢ãƒŠãƒªã‚·ã‚¹ã®æ‰¹åˆ¤çš„åŸå‘³ã®è¦ç‚¹ã‚’ç†è§£ã§ãã‚‹ã€‚ é–¢é€£Webã‚µã‚¤ãƒˆ: REQUIREç ”ç©¶ä¼š http://blue.zero.jp/yokumura/Rhtml/related_presentation.html#20141101
shiumachi 2010/01/25
"ç¾¤è¡†ã®çŸ¥æµï¼šé¸æŠžã«å¼·ã„ã€åˆ†æ•£æ€§ãŒé‡è¦ã€é›†ç´„ãŒå¿…è¦""é›†å›£çš„çŸ¥æ€§ï¼šå‰µé€ ã«å½¹ç«‹ã¤ã€å”åƒãŒé‡è¦ã€çŸ¥è¦‹ã‚„æˆæžœã®å…±æœ‰ã€ç›¸äº’åˆ©ç”¨ã€è©•ä¾¡ãŒå¿…è¦"

é›†åˆçŸ¥

èªã¿ç‰©
ãƒªãƒ³ã‚¯
non-Negative Matrix Factorization (NMF) - naoyaã®ã¯ã¦ãªãƒ€ã‚¤ã‚¢ãƒªãƒ¼
ä»¥å‰ã« Latent Semantic Indexing (LSI) ã‚„ HITS çµ¡ã¿ã§ SVD ã‚„ä¸»æˆåˆ†åˆ†æžã«ã¤ã„ã¦å°‘ã—æ›¸ãã¾ã—ãŸã€‚ http://d.hatena.ne.jp/naoya/20090212/latent_semantic_indexing http://d.hatena.ne.jp/naoya/20090301/hits LSI ã§ã¯ SVD ã‚’ä½¿ã£ã¦å˜èªžæ–‡æ›¸è¡Œåˆ—ã‚’åˆ†è§£ã—ã€ä½ŽéšŽæ•°è¿‘ä¼¼ã‚’è¡Œã„ã¾ã™ã€‚ã“ã‚Œã«ã‚ˆã‚Šã€ä¼¼ãŸã‚ˆã†ãªæ¬¡å…ƒã‚’ã¾ã¨ã‚ãŸã‚Šã¨ã„ã£ãŸåŠ¹æžœãŒå¾—ã‚‰ã‚Œã‚‹ã®ã§ã—ãŸã€‚è‡ªåˆ†ã®è€ƒå¯Ÿã§ã¯ HITS ã‚‚åŒæ§˜ã®ã“ã¨ã‚’è¡Œã£ã¦ã„ã‚‹ã¨ã„ã†èªè˜ã§ã—ãŸã€‚ ã•ã¦ã€é›†åˆçŸ¥ãƒ—ãƒã‚°ãƒ©ãƒŸãƒ³ã‚°ã‚’èªã‚“ã§ã„ãŸã‚‰ã€ç¬¬10ç« ã§ "non-Negative Matrix Factorization" (éžè² å€¤è¡Œåˆ—å› ååˆ†è§£, ä»¥ä¸‹NMF) ã¨ã„ã†æ‰‹æ³•ãŒå‡ºã¦ãã¾ã—ãŸã€‚NMF ã‚‚ SVD ã‚„ä¸»æˆåˆ†åˆ†æžã«åŒã˜ãè¡Œåˆ—ã‚’åˆ†è§£
shiumachi 2010/01/23
algorithm

é›†åˆçŸ¥
ãƒªãƒ³ã‚¯
[è‡ªå·±çµ„ç¹”åŒ–å†™åƒ] - Wikipedia
è‡ªå·±çµ„ç¹”åŒ–å†™åƒï¼ˆã˜ã“ãã—ãã‹ã—ã‚ƒãžã†ã€è‹±: Self-organizing maps, SOM, Self-organizing feature maps, SOFMï¼‰ã¯ãƒ‹ãƒ¥ãƒ¼ãƒ©ãƒ«ãƒãƒƒãƒˆãƒ¯ãƒ¼ã‚¯ã®ä¸€ç¨®ã§ã‚ã‚Šã€å¤§è„³çš®è³ªã®è¦–è¦šé‡Žã‚’ãƒ¢ãƒ‡ãƒ«åŒ–ã—ãŸã‚‚ã®ã§ã‚ã‚‹ã€‚è‡ªå·±çµ„ç¹”åŒ–å†™åƒã¯ã‚³ãƒ›ãƒãƒ³ã«ã‚ˆã£ã¦ææ¡ˆã•ã‚ŒãŸãƒ¢ãƒ‡ãƒ«ã§ã‚ã‚Šã€æ•™å¸«ãªã—å¦ç¿’ã«ã‚ˆã£ã¦å…¥åŠ›ãƒ‡ãƒ¼ã‚¿ã‚’ä»»æ„ã®æ¬¡å…ƒã¸å†™åƒã™ã‚‹ã“ã¨ãŒã§ãã‚‹ã€‚ä¸»ã«1ï½ž3æ¬¡å…ƒã¸ã®å†™åƒã«ç”¨ã„ã‚‰ã‚Œã€å¤šæ¬¡å…ƒã®ãƒ‡ãƒ¼ã‚¿ã®å¯è¦–åŒ–ãŒå¯èƒ½ã§ã‚ã‚‹ã€‚å‡ºåŠ›ã¨ãªã‚‹ç©ºé–“ã‚’ãƒžãƒƒãƒ— (map)ã€ç«¶åˆå±¤ (competitive layer)ã€ã‚‚ã—ãã¯å‡ºåŠ›å±¤ (output layer) ã¨å‘¼ã¶ã€‚å‡ºåŠ›å±¤ã«å¯¾ã—ã¦å…¥åŠ›ãƒ‡ãƒ¼ã‚¿ã®ç©ºé–“ã‚’å…¥åŠ›å±¤(input layer)ã¨å‘¼ã¶ã“ã¨ã‚‚ã‚ã‚‹ã€‚è‡ªå·±çµ„ç¹”åŒ–å†™åƒã¯ã‚³ãƒ›ãƒãƒ³ãƒžãƒƒãƒ— (Kohonen map)ã€ã‚³ãƒ›ãƒãƒ³ãƒãƒƒãƒˆãƒ¯ãƒ¼ã‚¯ (Kohonen network)ã€è‡ªå·±çµ„ç¹”åŒ–ãƒžãƒƒãƒ—ã€ã‚½ãƒ
shiumachi 2010/01/19
"äººå·¥ãƒ‹ãƒ¥ãƒ¼ãƒãƒ³ã‚’æ ¼åçŠ¶ã«é…ç½®ã—ã€ï¼ˆå…¥åŠ›å±¤ã‹ã‚‰ã®ï¼‰ã‚·ãƒŠãƒ—ã‚¹çµåˆã®é‡ã¿ã‚’å¦ç¿’ã™ã¹ãå…¥åŠ›ãƒ™ã‚¯ãƒˆãƒ«ã®é›†åˆï¼ˆãƒˆãƒ¬ãƒ¼ãƒ‹ãƒ³ã‚°ã‚»ãƒƒãƒˆï¼‰ã¨é©åˆã™ã‚‹ã‚ˆã†ã«å¤‰åŒ–ã•ã›ã‚‹"

ã‚¯ãƒ©ã‚¹ã‚¿ãƒªãƒ³ã‚°

AI

é›†åˆçŸ¥
ãƒªãƒ³ã‚¯
Jaccard index - Wikipedia
Toggle Probability Jaccard similarity and distance subsection
shiumachi 2010/01/14
ç©é›†åˆ/å’Œé›†åˆã¯Jaccardä¿‚æ•°ã€‚tanimotoä¿‚æ•°ã¯ã¡ã‚‡ã£ã¨ã¡ãŒã†ã€‚

é›†åˆçŸ¥

è·é›¢ç©ºé–“
ãƒªãƒ³ã‚¯
è·é›¢ç©ºé–“ - Wikipedia
è·é›¢ç©ºé–“ï¼ˆãã‚‡ã‚Šãã†ã‹ã‚“ã€metric spaceï¼‰ã¨ã¯ã€è·é›¢é–¢æ•°ï¼ˆãã‚‡ã‚Šã‹ã‚“ã™ã†ï¼‰ã¨å‘¼ã°ã‚Œã‚‹éžè² å®Ÿæ•°å€¤é–¢æ•°ãŒä¸Žãˆã‚‰ã‚Œã¦ã„ã‚‹é›†åˆã®ã“ã¨ã§ã‚ã‚‹ã€‚ å¤ä»£ã‚ˆã‚Šã€å¹³é¢ã‚„ç©ºé–“ã€åœ°ä¸Šã® 2 ç‚¹é–“ã®é›¢ã‚Œå…·åˆã‚’è¡¨ã™å°ºåº¦ã§ã‚ã‚‹è·é›¢ã¯æ¸¬é‡ã‚„ç§‘å¦ã€æ•°å¦ã«ãŠã„ã¦é‡è¦ãªå½¹å‰²ã‚’æžœãŸã—ã¦ããŸã€‚1906å¹´ã«ãƒ¢ãƒ¼ãƒªã‚¹ãƒ»ãƒ•ãƒ¬ã‚·ã‚§ã¯ã€æ§˜ã€…ãªé›†åˆã®ä¸Šã§å®šç¾©ã•ã‚ŒãŸé–¢æ•°ã®ä¸€æ§˜é€£ç¶šæ€§ã®æ¦‚å¿µã‚’çµ±ä¸€çš„ã«ç ”ç©¶ã—ãŸè«–æ–‡ FrÃ©chet (1906)[æ³¨é‡ˆ 1]ã«ãŠã„ã¦ã€ãƒ¦ãƒ¼ã‚¯ãƒªãƒƒãƒ‰ç©ºé–“ã‹ã‚‰è·é›¢ã®æ¦‚å¿µã‚’æŠ½å‡ºã—ã¦ç”¨ã„ã€è·é›¢ç©ºé–“ã®ç†è«–ã‚’ç¯‰ã„ãŸã€‚ å¹³é¢ R2 ã®ä¸Šã® 2 ç‚¹ P1 = (x1, y1), P2 = (x2, y2) ã®é–“ã®è·é›¢ã«ã‚‚ãƒžãƒ³ãƒãƒƒã‚¿ãƒ³è·é›¢ ã‚„ãƒ¦ãƒ¼ã‚¯ãƒªãƒƒãƒ‰è·é›¢ ãªã©ãŒã‚ã‚Šã€åŒã˜é›†åˆã«å¯¾ã—ã¦ä½•ç¨®é¡žã‚‚ã®ç•°ãªã‚‹è·é›¢é–¢æ•°ã‚’è€ƒãˆã‚‹äº‹ã‚‚å°‘ãªããªã„ãŸã‚ã€é›†åˆ X ã¨è·é›¢é–¢æ•° d ã‚’çµ„ã«ã—ã¦ (X,d) ã¨æ›¸ãã€è·é›¢ç©ºé–“ã¨å‘¼ã¶ã€‚ ç‰¹ã«è·é›¢ãŒä¸Žãˆ
shiumachi 2010/01/11
å”èª¿ãƒ•ã‚£ãƒ«ã‚¿ãƒªãƒ³ã‚°ã«ãŠã‘ã‚‹é¡žä¼¼æ€§ã‚¹ã‚³ã‚¢ã®ç®—å‡ºã«ä½¿ã†

æ•°å¦

é›†åˆçŸ¥
ãƒªãƒ³ã‚¯
ãƒ¬ã‚³ãƒ¡ãƒ³ãƒ€ã‚·ã‚¹ãƒ†ãƒ - Wikipedia
ãƒ¬ã‚³ãƒ¡ãƒ³ãƒ€ã‚·ã‚¹ãƒ†ãƒ ï¼ˆè‹±: recommender systemï¼‰ã¯ã€æƒ…å ±ãƒ•ã‚£ãƒ«ã‚¿ãƒªãƒ³ã‚° (IF) æŠ€æ³•ã®ä¸€ç¨®ã§ã€ç‰¹å®šãƒ¦ãƒ¼ã‚¶ãƒ¼ãŒèˆˆå‘³ã‚’æŒã¤ã¨æ€ã‚ã‚Œã‚‹æƒ…å ±ï¼ˆæ˜ ç”»ã€éŸ³æ¥½ã€æœ¬ã€ãƒ‹ãƒ¥ãƒ¼ã‚¹ã€ç”»åƒã€ã‚¦ã‚§ãƒ–ãƒšãƒ¼ã‚¸ãªã©ï¼‰ã€ã™ãªã‚ã¡ã€ŒãŠã™ã™ã‚ã€ã‚’æç¤ºã™ã‚‹ã‚‚ã®ã§ã‚ã‚‹ã€‚é€šå¸¸ã®ãƒ¬ã‚³ãƒ¡ãƒ³ãƒ€ã‚·ã‚¹ãƒ†ãƒ ã¯ã€ãƒ¦ãƒ¼ã‚¶ãƒ¼ã®ãƒ—ãƒãƒ•ã‚¡ã‚¤ãƒ«ã‚’ä½•ã‚‰ã‹ã®ãƒ‡ãƒ¼ã‚¿åŽé›†åŸºæº–ã¨æ¯”è¼ƒæ¤œè¨Žã—ã€ãƒ¦ãƒ¼ã‚¶ãƒ¼ãŒå€‹ã€…ã®ã‚¢ã‚¤ãƒ†ãƒ ã«ã¤ã‘ã‚‹ã§ã‚ã‚ã†è©•ä¾¡ã‚’äºˆæ¸¬ã™ã‚‹ã€‚åŸºæº–ã¯æƒ…å ±ã‚¢ã‚¤ãƒ†ãƒ å´ã‹ã‚‰å½¢æˆã™ã‚‹å ´åˆï¼ˆã‚³ãƒ³ãƒ†ãƒ³ãƒ„ãƒ™ãƒ¼ã‚¹ã®æ‰‹æ³•ï¼‰ã¨ãƒ¦ãƒ¼ã‚¶ãƒ¼ã®ç¤¾ä¼šç’°å¢ƒã‹ã‚‰å½¢æˆã™ã‚‹å ´åˆï¼ˆå”èª¿ãƒ•ã‚£ãƒ«ã‚¿ãƒªãƒ³ã‚°ã®æ‰‹æ³•ï¼‰ãŒã‚ã‚‹ã€‚ ãƒ¦ãƒ¼ã‚¶ãƒ¼ã®ãƒ—ãƒãƒ•ã‚¡ã‚¤ãƒ«ã‚’æ§‹ç¯‰ã™ã‚‹ã¨ãã€ãƒ‡ãƒ¼ã‚¿åŽé›†ã®æ˜Žç¤ºçš„éƒ¨åˆ†ã¨æš—é»™çš„éƒ¨åˆ†ã‚’åŒºåˆ¥ã™ã‚‹ã€‚ æ˜Žç¤ºçš„ãƒ‡ãƒ¼ã‚¿åŽé›†ã«ã¯æ¬¡ã®ã‚ˆã†ãªã‚‚ã®ãŒã‚ã‚‹ã€‚ ãƒ¦ãƒ¼ã‚¶ãƒ¼ã«ã‚ã‚‹ã‚¢ã‚¤ãƒ†ãƒ ã®è©•ä¾¡ã‚’ä»˜ã‘ã¦ã‚‚ã‚‰ã†ï¼ˆä¾‹ãˆã°5æ®µéšŽè©•ä¾¡ï¼‰ã€‚ ãƒ¦ãƒ¼ã‚¶ãƒ¼ã«ä¸€ç¾¤ã®ã‚¢ã‚¤ãƒ†ãƒ ã‚’å¥½ãã‹å«Œã„ã‹ãƒ©ãƒ³ã‚¯ä»˜ã‘ã—ã¦ã‚‚ã‚‰ã†ã€‚ ãƒ¦ãƒ¼ã‚¶ãƒ¼ã«2ã¤ã®
shiumachi 2010/01/04
"äºˆæ¸¬ã®æ£ç¢ºã•ã¯ã€è¤‡æ•°ã®äºˆæ¸¬ã‚’æ··åˆã™ã‚‹ã¨ãã«å¤§å¹…ã«é«˜ã‚ã‚‰ã‚Œã‚‹ã€‚æˆ‘ã€…ã®çµŒé¨“ã«ã‚ˆã‚Œã°ã€1ã¤ã®æŠ€æ³•ã‚’æ”¹è‰¯ã™ã‚‹ã‚ˆã‚Šã‚‚ã€è¤‡æ•°ã®ç•°ãªã‚‹æŠ€æ³•ã‚’æ–°ãŸã«ç”Ÿã¿å‡ºã™æ–¹ãŒã‚ˆã„"

algorithm

é›†åˆçŸ¥
ãƒªãƒ³ã‚¯
å”èª¿ãƒ•ã‚£ãƒ«ã‚¿ãƒªãƒ³ã‚° - Wikipedia
å”èª¿ãƒ•ã‚£ãƒ«ã‚¿ãƒªãƒ³ã‚°ã‚’ä½¿ç”¨ã—ã¦ãƒ¦ãƒ¼ã‚¶ãƒ¼ã®è©•ä¾¡ã‚’äºˆæ¸¬ã™ã‚‹ä¾‹ã€‚æœ€åˆã¯ã€ã•ã¾ã–ã¾ãªé …ç›® (å‹•ç”»ã€ç”»åƒã€ã‚²ãƒ¼ãƒ ãªã©) ã‚’è©•ä¾¡ã™ã‚‹ã€‚ãã®å¾Œã€ã‚·ã‚¹ãƒ†ãƒ ã¯ã€ãƒ¦ãƒ¼ã‚¶ãƒ¼ãŒã¾ã è©•ä¾¡ã—ã¦ã„ãªã„ã‚¢ã‚¤ãƒ†ãƒ ã«å¯¾ã™ã‚‹ãƒ¦ãƒ¼ã‚¶ãƒ¼ã®è©•ä¾¡ã«ã¤ã„ã¦äºˆæ¸¬ã™ã‚‹ã€‚ã“ã‚Œã‚‰ã®äºˆæ¸¬ã¯ã€ã‚¢ã‚¯ãƒ†ã‚£ãƒ–ãªãƒ¦ãƒ¼ã‚¶ãƒ¼ã¨åŒæ§˜ã®è©•ä¾¡ã‚’æŒã¤ä»–ã®ãƒ¦ãƒ¼ã‚¶ãƒ¼ã®æ—¢å˜ã®è©•ä¾¡ã«åŸºã¥ã„ã¦ä½œæˆã•ã‚Œã‚‹ã€‚ä¾‹ãˆã°ä¸Šè¨˜ã®å ´åˆã€ã‚·ã‚¹ãƒ†ãƒ ã¯ã€ã‚¢ã‚¯ãƒ†ã‚£ãƒ–ãªãƒ¦ãƒ¼ã‚¶ãƒ¼ãŒãƒ“ãƒ‡ã‚ªã‚’æ°—ã«å…¥ã‚‰ãªã„ã ã‚ã†ã¨äºˆæ¸¬ã—ã¦ã„ã‚‹ã€‚ å”èª¿ãƒ•ã‚£ãƒ«ã‚¿ãƒªãƒ³ã‚°ï¼ˆãã‚‡ã†ã¡ã‚‡ã†ãƒ•ã‚£ãƒ«ã‚¿ãƒªãƒ³ã‚°ã€Collaborative Filteringã€CFï¼‰ã¯ã€å¤šãã®ãƒ¦ãƒ¼ã‚¶ã®å—œå¥½æƒ…å ±ã‚’è“„ç©ã—ã€ã‚ã‚‹ãƒ¦ãƒ¼ã‚¶ã¨å—œå¥½ã®é¡žä¼¼ã—ãŸä»–ã®ãƒ¦ãƒ¼ã‚¶ã®æƒ…å ±ã‚’ç”¨ã„ã¦è‡ªå‹•çš„ã«æŽ¨è«–ã‚’è¡Œã†æ–¹æ³•è«–ã§ã‚ã‚‹ã€‚è¶£å‘³ã®ä¼¼ãŸäººã‹ã‚‰ã®æ„è¦‹ã‚’å‚è€ƒã«ã™ã‚‹ã¨ã„ã†å£ã‚³ãƒŸã®åŽŸç†ã«ä¾‹ãˆã‚‰ã‚Œã‚‹ã“ã¨ãŒå¤šã„ã€‚ ä¾‹ãˆã°ã€ãƒ¦ãƒ¼ã‚¶AãŒã‚¢ã‚¤ãƒ†ãƒ Xã‚’å¥½ã‚€ã¨ã™ã‚‹ã¨ã€ã‚¢ã‚¤ãƒ†ãƒ Xã‚’å¥½ã‚€åˆ¥ã®ãƒ¦ãƒ¼ã‚¶BãŒå¥½ã‚€ã‚¢ã‚¤ãƒ†ãƒ Yã‚’
shiumachi 2010/01/04
algorithm

é›†åˆçŸ¥
ãƒªãƒ³ã‚¯
ç›¸å¯¾å¥½ã¿è©•ä¾¡ã«ã¤ã„ã¦æ›¸ãç›´ã—ã¦ã¿ãŸã€‚ - ã‚·ã‚¤ã‚µã‚¤ãƒ‰ã®æ—¥è¨˜ï¼ˆä»Šå¹´ã„ã£ã±ã„ã§å‰Šé™¤äºˆå®šï¼‰
å‰å›žã¨ã®é•ã„ ï¼‘ã¤ã®ã‚¨ãƒ³ãƒˆãƒªãƒ¼ã«æƒ…å ±ã‚’ã¾ã¨ã‚ã€æ–°ã—ãé †ä½ä»˜ã‘æ‰‹æ³•ã‚’è¿½åŠ ã€‚ å‰å›žã®ã‚¨ãƒ³ãƒˆãƒªãƒ¼ã¯ã“ã¡ã‚‰ ç›¸å¯¾å¥½ã¿è©•ä¾¡ã¨ã¯ ç›¸å¯¾å¥½ã¿è©•ä¾¡ã¨ã¯ã€ãã®ä½œå“ãŒã©ã®ãã‚‰ã„è¦–è´è€…ã«å¥½ã¾ã‚Œã¦ã„ã‚‹ã‹ã‚’ã€ãƒ¦ãƒ¼ã‚¶ãƒ¼ãŒè¡Œã£ãŸä»–ã®ä½œå“ã¨ã®æ¯”è¼ƒè©•ä¾¡ãƒ‡ãƒ¼ã‚¿ã‚’å…ƒã«æ•°å€¤åŒ–ã™ã‚‹è©•ä¾¡æ–¹å¼ã€‚ æ¯”è¼ƒè©•ä¾¡ã¨ã¯ã€ä½œå“ï¼¡ã¨ä½œå“ï¼¢ã‚’è©•ä¾¡ã™ã‚‹æ™‚ã€ã€Œï¼¡ãŒï¼¢ã‚ˆã‚Šå¥½ã¿ã€ã¨ã€Œï¼¢ãŒï¼¡ã‚ˆã‚Šå¥½ã¿ã€ã®ã©ã¡ã‚‰ã‹ã§è©•ä¾¡ã™ã‚‹äº‹ã€‚ ä»¥ä¸‹ã€æ•°å€¤åŒ–ã•ã‚ŒãŸè©•ä¾¡ã‚’è©•ä¾¡å€¤ã¨å‘¼ã¶ã€‚ ä»¥ä¸‹ã€è©•ä¾¡ã‚’è¡Œã†ãƒ¦ãƒ¼ã‚¶ãƒ¼ã‚’ãƒ¬ãƒ“ãƒ¥ã‚¢ãƒ¼ã¨å‘¼ã¶ã€‚ è©•ä¾¡å€¤ã¯ä½•ã‚’æ„å‘³ã™ã‚‹ã®ã‹ ä½œå“ï¼¡ãŒã€ä½œå“ï¼¢ã‚ˆã‚Šè©•ä¾¡å€¤ãŒï¼®ç‚¹é«˜ã„å ´åˆã€ä½œå“ï¼¡ã¨ï¼¢ã‚’æ¯”è¼ƒè©•ä¾¡ã—ãŸæ™‚ã€ä½œå“ï¼¡ã®ã»ã†ãŒå¥½ã¿ã ã¨ç”ãˆã‚‹ãƒ¬ãƒ“ãƒ¥ã‚¢ãƒ¼ã®å‰²åˆãŒï¼¢ã®ã‚ˆã‚Šï¼ï¼…é«˜ã„ã¨æŽ¨å®šã•ã‚Œã‚‹ã€‚ã®ã‚ˆã†ãªäº‹ã‚’è¡¨ã™ã€‚ ä¾‹ãˆã‚‹ãªã‚‰ã€ãƒ‰ãƒ©ã‚´ãƒ³ãƒœãƒ¼ãƒ«ã®æˆ¦é—˜åŠ›ã‚’å¯¾æ•°è¡¨è¨˜ã—ãŸã‚‚ã®ã€‚ãŒè¿‘ã„ã‹ã‚‚ã—ã‚Œãªã„ã€‚ æŽ¡ç‚¹æ–¹å¼ã¨ã®é•ã„ ãƒ¬ãƒ“ãƒ¥ã‚¢ãƒ¼ãŒ0ã€œ10ç‚¹ã®é–“ã§æŠ•ç¥¨ã‚’è¡Œã„ã€ãã®å¹³å‡ã‚’è©•ä¾¡å€¤ã«ã™ã‚‹æŽ¡ç‚¹æ–¹å¼
shiumachi 2009/09/24
algorithm

é›†åˆçŸ¥
ãƒªãƒ³ã‚¯
1