[B! research] ttakezawaã®ãƒ–ãƒƒã‚¯ãƒžãƒ¼ã‚¯

ttakezawa id:ttakezawa

researchã«é–¢ã™ã‚‹ttakezawaã®ãƒ–ãƒƒã‚¯ãƒžãƒ¼ã‚¯ (140)

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

ãƒ‡ãƒ¼ã‚¿ãƒžã‚¤ãƒ‹ãƒ³ã‚°ã§ä½¿ã‚ã‚Œã‚‹ãƒˆãƒƒãƒ—10ã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ - ã€Žä¼æ¥æˆé•·ã®æ–¹ç¨‹å¼ â€• AIDã‚°ãƒãƒ¼ã‚¹ã‚³ãƒŸãƒƒãƒˆã«ã‚ˆã‚‹æˆé•·æˆ¦ç•¥ã€
2006å¹´ã®ãƒ‡ãƒ¼ã‚¿ãƒžã‚¤ãƒ‹ãƒ³ã‚°å¦ä¼šã€IEEE ICDMã§é¸ã°ã‚ŒãŸã€Œãƒ‡ãƒ¼ã‚¿ãƒžã‚¤ãƒ‹ãƒ³ã‚°ã§ä½¿ã‚ã‚Œã‚‹ãƒˆãƒƒãƒ—10ã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ ã€ã«æ²¿ã£ã¦æ©Ÿæ¢°å¦ç¿’ã®æ‰‹æ³•ã‚’ç´¹ä»‹ã—ã¾ã™ï¼ˆã“ã®è«–æ–‡ã¯@doryokujinå›ã®ãƒã‚¹ãƒˆã§çŸ¥ã‚Šã¾ã—ãŸã€ã‚ã‚ŠãŒã¨ã†ã”ã–ã„ã¾ã™ï¼ï¼‰ã€‚ å¿…ãšã—ã‚‚è«–æ–‡ã®å†…å®¹ã«ã¯æ²¿ã£ã¦ãŠã‚‰ãšå€‹äººçš„ãªç§è¦‹ã‚‚å…¥ã£ã¦ã„ã¾ã™ã®ã§ã€è©³ç´°ã¯åŽŸè«–æ–‡ã‚’ã”ç¢ºèªä¸‹ã•ã„ã€‚ã¾ãŸã€ãƒ‡ãƒ¼ã‚¿ãƒžã‚¤ãƒ‹ãƒ³ã‚°ã®å…¨ä½“è¦³ã‚’ã‚µãƒ¼ãƒ™ã‚¤ã—ãŸã‚¹ãƒ©ã‚¤ãƒ‰è³‡æ–™ãŒã‚ã‚Šã¾ã™ã®ã§ã€ã“ã¡ã‚‰ã‚‚ä½µã›ã¦ã”è¦§ä¸‹ã•ã„ã€‚ ãƒ‡ãƒ¼ã‚¿ãƒžã‚¤ãƒ‹ãƒ³ã‚°ã®åŸºç¤Ž View more presentations from Issei Kurahashi 1. C4.5 C4.5ã¯CLSã‚„ID3ã¨ã„ã£ãŸã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ ã‚’æ”¹è‰¯ã—ã¦ã§ããŸã‚‚ã®ã§ã€æ±ºå®šæœ¨ã‚’ä½¿ã£ã¦åˆ†é¡žå™¨ã‚’ä½œã‚Šã¾ã™ã€‚æ±ºå®šæœ¨ã¨ã„ãˆã°CARTãŒè‰¯ãä½¿ã‚ã‚Œã¾ã™ãŒã€CARTã¨ã®é•ã„ã¯ä»¥ä¸‹ã®ã¨ãŠã‚Šã§ã™ã€‚ CARTã¯2åˆ†å²ã—ã‹ã§ããªã„ãŒC4.5ã¯3åˆ†å²ä»¥ä¸Šã‚‚ã§ãã‚‹ C
ttakezawa 2011/11/25
research

mining

datamining

algorithm
ãƒªãƒ³ã‚¯
éŽåŽ»10å¹´é–“ã®Computer Scienceç³»è«–æ–‡ã§è¢«å¼•ç”¨æ•°ãƒˆãƒƒãƒ—10ã‚’ä½œã£ã¦ã¿ãŸ - æƒ…å ±ç§‘å¦å±‹ã•ã‚“ã‚’ç›®æŒ‡ã™äººã®ãƒ¡ãƒ¢ï¼ˆFC2ãƒ–ãƒã‚°ç‰ˆï¼‰
ä½•ã‹ã®ã‚„ã‚Šæ–¹ã‚„ã€å•é¡Œã®è§£æ±ºæ–¹æ³•ã‚’ã©ã‚“ã©ã‚“ãƒ¡ãƒ¢ã™ã‚‹ãƒ–ãƒã‚°ã€‚ãã‚“ãªå¤§å¦é™¢ç”Ÿã®æ´»å‹•ã€Œã‚ãƒ£ãƒƒã‚·ãƒ¥ã€ã«èª°ã‹ãŒãƒ’ãƒƒãƒˆã—ã¦ãã‚Œã‚‹ã“ã¨ã‚’ç¥ˆã£ã¦ã€‚ 2000å¹´ä»¥é™ã®è«–æ–‡ã«é™å®šã—ã¦ã€ CSç³»è«–æ–‡ã®è¢«å¼•ç”¨æ•°ãƒ©ãƒ³ã‚ãƒ³ã‚°ã‚’ä½œã£ã¦åˆ†æžã—ã¦ã¿ãŸã€‚ ã“ã®ä½œæ¥ã‚’é€šã˜ã¦äºˆæƒ³ä»¥ä¸Šã«å¾—ã‚‹ã‚‚ã®ãŒã‚ã£ãŸã€‚ ãƒ©ãƒ³ã‚ãƒ³ã‚°ã®ä½œã‚Šæ–¹ CiteSeerXãŒå…¬é–‹ã—ã¦ã„ã‚‹ã€ŒMost Cited Computer Science ArticlesÂ (2010/9/14)ã€ã‚’å…ƒãƒ‡ãƒ¼ã‚¿ã«æŽ¡ç”¨ã—ãŸã€‚ ã“ã“ã‹ã‚‰2000å¹´ä»¥é™ã®æ–‡ç« ã«é™å®šã—ãŸå¾Œã€ãƒãƒ³ãƒ‰ãƒ–ãƒƒã‚¯ã‚„é›‘èªŒè¨˜äº‹ãªã©ã‚’å–ã‚Šé™¤ã„ã¦è«–æ–‡ã ã‘ã®ãƒ©ãƒ³ã‚ãƒ³ã‚°ã‚’ä½œæˆã—ãŸã€‚ è¢«å¼•ç”¨æ•°ã¯æ™‚é–“ãŒçµŒã¤ã»ã©å¢—ãˆã‚‹ä¸€æ–¹ãªã®ã§ã€2000å¹´ãƒ»2001å¹´ã‚ãŸã‚Šã®è«–æ–‡ãŒæœ‰åˆ©ã§ã‚ã‚‹ã“ã¨ã«æ³¨æ„ã™ã‚‹å¿…è¦ãŒã‚ã‚‹ã€‚ ãŸã ã—ã€ã“ã®ã“ã¨ãŒã‹ãˆã£ã¦å¾—ã‚‹ã‚‚ã®ã‚’å¢—ã‚„ã—ã¦ãã‚ŒãŸã€‚ ã‚¢ãƒ–ã‚¹ãƒˆãƒ©ã‚¯ãƒˆã‚’ãƒã‚§ãƒƒã‚¯ è‰¯ã„æ©Ÿä¼šã§ã‚ã‚‹ã®ã§ã€ å„è«–æ–‡ã®æ¦‚è¦ã‚„çµè«–ã‚’ãƒã‚§ãƒƒã‚¯
ttakezawa 2011/09/21
research

p2p

chord
ãƒªãƒ³ã‚¯
æ©Ÿæ¢°å¦ç¿’è¶…å…¥é–€ ã€œãã‚ãã‚ãƒŠã‚¤ãƒ¼ãƒ–ãƒ™ã‚¤ã‚ºã«ã¤ã„ã¦ã²ã¨ã“ã¨è¨€ã£ã¦ãŠãã‹ã€œ - EchizenBlog-Zwei
æœ€è¿‘ã§ã¯æ©Ÿæ¢°å¦ç¿’ã®èªçŸ¥åº¦ã‚‚ä¸ŠãŒã£ã¦ãã¦ã„ã¦å°‚é–€å®¶ã§ãªãã¦ã‚‚ãƒŠã‚¤ãƒ¼ãƒ–ãƒ™ã‚¤ã‚ºã‚„SVMãªã©ã®åå‰ã‚’çŸ¥ã£ã¦ã„ã‚‹äººã‚‚å¢—ãˆã¦ããŸã‚ˆã†ã«æ€ã†ã€‚ ãã‚“ãªã‚ã‘ã§ã¡ã‚‡ã£ã¨æ©Ÿæ¢°å¦ç¿’ã‚’ã¯ã˜ã‚ã¦ã¿ã‚ˆã†ã‹ãªã€ã¨æ€ã£ã¦ã„ã‚‹äººã‚‚å¤šã„ã®ã§ã¯ãªã„ã ã‚ã†ã‹ã€‚ã¨ã¯ã„ãˆã€Œæ•°å¼ã‚ˆãã‚ã‹ã‚‰ãªã„ã€ã€Œç¢ºçŽ‡å«Œã„ã€ã¨ã„ã£ãŸç†ç”±ã§å°»è¾¼ã¿ã—ã¦ã„ã‚‹ã‚±ãƒ¼ã‚¹ã‚‚å¤šã„ã®ã§ã¯ã€‚ ãã“ã§äºˆå‚™çŸ¥è˜ã‚¼ãƒã§ã‚‚ã‚ã‹ã‚‹ã‚ˆã†ãªæ©Ÿæ¢°å¦ç¿’ã®å…¥é–€è¨˜äº‹ã‚’æ›¸ã„ã¦ã¿ãŸã‚ˆã€‚ æ©Ÿæ¢°å¦ç¿’ã‚’ã€Œä½œã‚ŠãŸã„ã€ã®ã‹ã€Œä½¿ã„ãŸã„ã®ã‹ã€ ã¾ãšæœ€åˆã«ç¢ºèªã—ãŸã„ã®ãŒã“ã‚Œã€‚ä½¿ã„ãŸã„ã ã‘ãªã‚‰ã¾ãšã¯SVMã‚’ä½¿ã£ã¦ã¿ã‚Œã°è‰¯ã„ã€‚ä¸–ã®ä¸ã«ã¯libsvmã‚„svmlightã¨ã„ã†è‰¯ã„ãƒ„ãƒ¼ãƒ«ãŒã‚ã‚‹ã®ã§ãã‚Œã‚’ä½¿ãŠã†ã€‚ä»¥ä¸‹ã®è¨˜äº‹ã¯æ©Ÿæ¢°å¦ç¿’ã‚’ã€Œä½œã‚ŠãŸã„ã€ã€Œä»•çµ„ã¿ã‚’çŸ¥ã‚ŠãŸã„ã€äººå‘ã‘ã®å†…å®¹ã«ãªã£ã¦ã„ã‚‹ã€‚ ã€Œæœ€ã‚‚ç°¡å˜ãªæ©Ÿæ¢°å¦ç¿’ã¯ãƒŠã‚¤ãƒ¼ãƒ–ãƒ™ã‚¤ã‚ºã€ã¨ã„ã†å¹»æƒ³ æ©Ÿæ¢°å¦ç¿’ã¨ã„ãˆã°ãƒŠã‚¤ãƒ¼ãƒ–ãƒ™ã‚¤ã‚ºã¨ã„ã†è©±ãŒã‚ˆãã‚ã‚‹ã€‚ãƒŠã‚¤ãƒ¼ãƒ–(å˜ç´”)ã¨ã„ã†åå‰ã‹ã‚‰ã„ã‹
ttakezawa 2011/01/16
nlp

research

machinelearning

book
ãƒªãƒ³ã‚¯
ç ”ç©¶å®¤ã®å…ˆç”ŸãŒå¼•ãæŠœã‹ã‚ŒãŸã‚‰ã—ã„
å®‡ä½ç¾Žã‚†ã† @yusmi æ•™æŽˆã‚ã„ã•ã¤ã€Œæ–°å¹´æ˜Žã‘ã¾ã—ã¦ãŠã‚ã§ã¨ã†ã€‚æ€¥ãªè©±ã§ã™ãŒç§ãŒæ¥å¹´åº¦ã‹ã‚‰ä»–ã®è·ã«ç§»ã‚‹ã“ã¨ã«ãªã‚Šã¾ã—ãŸã®ã§ã€ã¾ã èª²ç¨‹ãŒæ®‹ã£ã¦ã„ã‚‹æ–¹ã¯é ‘å¼µã£ã¦å¦ä½ã‚’å–å¾—ã—ã¦ãã ã•ã„ã€è¦ç´„ã™ã‚‹ã¨ã“ã‚“ãªæ„Ÿã˜ã ã£ãŸ 2011-01-14 21:18:29
ttakezawa 2011/01/15
ã³ã£ãã‚Šã

nlp

research

u-tokyo
ãƒªãƒ³ã‚¯
LDAå…¥é–€
ã€DLè¼ªèªä¼šã€‘SimCSE: Simple Contrastive Learning of Sentence Embeddings (EM NLP 2021)
ttakezawa 2010/12/24
machinelearning

clustering

research

nlp
ãƒªãƒ³ã‚¯
Loading...
ttakezawa 2010/12/14
research

nlp

paper
ãƒªãƒ³ã‚¯
ACL Anthology Â» D10
ACL Anthology A Digital Archive of Research Papers in Computational Linguistics Proceedings of the 2010 Conference on Empirical Methods in Natural Language Processing D10-1 [bib]: Entire volume D10-1000: Front Matter D10-1001 [bib]: Alexander M Rush; David Sontag; Michael Collins; Tommi Jaakkola On Dual Decomposition and Linear Programming Relaxations for Natural Language Processing D10-1002 [bib]
ttakezawa 2010/10/09
EMNLP 2010

research

paper

machinelearning
ãƒªãƒ³ã‚¯
ICWSM 2010 - International AAAI Conference on Weblogs and Social Media
May 23-26, 2010, George Washington University, Washington, DC Full papers | Poster papers | Demos | Data Workshop All papers are available here. Full Papers 10: Activity Lifespan: An Analysis of User Survival Patterns in Online Knowledge Sharing Communities Jiang Yang, Xiao Wei, Mark S. Ackerman, Lada A. Adamic 17: Predicting Elections with Twitter: What 140 Characters Reveal about Political Senti
ttakezawa 2010/10/01
research

paper
ãƒªãƒ³ã‚¯
Sketch2Photo: Internet Image Montage
Sketch2Photo: Internet Image Montage Tao Chen1Â Â Ming-Ming Cheng1Â Â Ping Tan2Â Â Ariel Shamir3Â Â Shi-Min Hu1 1TNList, Department of Computer Science and Techno logy, Tsinghua University 2National University of SingaporeÂ Â Â Â 3The Interdisciplinary Center Abstract We present a system that composes a realistic picture from a simple freehand sketch annotated with text labels. The composed picture is generate
ttakezawa 2010/09/12
research

image_processing

paper
ãƒªãƒ³ã‚¯
Ontology Alignment
A large number of information systems use many different individual schemas to represent data. Semantically linking these schemas is a necessary precondition to establish interoperability between agents and services. Consequently, ontology alignment and mapping for data integration has becomeÂ central to building a world-wide semantic web. Ontology Alignment: Bridging the Semantic Gap introduces no
ttakezawa 2010/06/16
research

ontology

book
ãƒªãƒ³ã‚¯
ç¬¬1å›žIBISMLç ”ç©¶ä¼š | æƒ…å ±è«–çš„å¦ç¿’ç†è«–ã¨æ©Ÿæ¢°å¦ç¿’ (IBISML) ç ”ç©¶ä¼š
ã‚³ãƒ³ãƒ†ãƒ³ãƒ„ã¸ã‚¹ã‚ãƒƒãƒ—
ttakezawa 2010/06/14
machinelearning

research

conference
ãƒªãƒ³ã‚¯
Hadoop ã‚’ä½¿ã†ã¹ãå ´åˆãƒ»ä½¿ã†ã¹ãã§ãªã„å ´åˆ - æ¦è”µé‡Žæ—¥è¨˜
id:ny23 ã•ã‚“ãŒå‹•çš„ãƒ€ãƒ–ãƒ«é…åˆ—ã‚’ä½¿ã£ã¦ Wikipedia ã®ãƒ†ã‚ã‚¹ãƒˆå‡¦ç†ã‚’é«˜é€ŸåŒ–ãªã‚“ã¦ã®ã‚’æ›¸ã„ã¦ã„ã‚‹ã€‚ãŸã¶ã‚“ã“ã‚Œã®ã‚¨ãƒ³ãƒˆãƒªã‚’è¦‹ã‚‹å‰ã«MapReduce ã¨å››èº«ã®æ‹³ã‚’è¦‹ãŸæ–¹ãŒã‚³ãƒ³ãƒ†ã‚¯ã‚¹ãƒˆãŒåˆ†ã‹ã‚‹ã¨æ€ã†ã€‚Hadoop ä½¿ã£ã¦ãªã‚“ã§ã‚‚ã§ããã†ï¼ Hadoop ã®å‹‰å¼·ã—ãŸã„ï¼ãªã‚“ã¦æ€ã£ã¦ã„ã‚‹äººã¯èªã‚“ã§ã¿ã‚‹ã¨ã‚ˆã„ã€‚ è‡ªåˆ†ã®è€ƒãˆã«ã¤ã„ã¦æ›¸ã„ã¦ãŠãã¨ã€è‡ªåˆ†ã¯èª°ã‚‚å½¼ã‚‚ Hadoop ä½¿ã„ãŸãŒã‚‹çŠ¶æ³ã«ã¯è¾Ÿæ˜“ã—ã¦ã„ã‚‹ã€‚ã»ã¨ã‚“ã©ã®äººã«ã¯ä¸è¦ãªã¯ãšã ã—ã€ãã‚‚ãã‚‚ Hadoop ã¯(ny23 ã•ã‚“ã‚‚æ›¸ã‹ã‚Œã¦ã„ã‚‹ãŒ)ãƒ¡ãƒ¢ãƒªã«ä¹—ã‚Šåˆ‡ã‚‰ãªã„å¤§è¦æ¨¡ãƒ‡ãƒ¼ã‚¿ã‚’æ‰±ã„ãŸã„ã¨ãã«åŠ¹åŠ›ã‚’ç™ºæ®ã™ã‚‹ã®ã§ã‚ã£ã¦ã€ãƒ¡ãƒ¢ãƒªã«ä¹—ã‚Šåˆ‡ã‚‹ãã‚‰ã„ã®ã‚µã‚¤ã‚ºã§ã‚ã‚Œã°ã€ãƒ‡ãƒ¼ã‚¿æ§‹é€ ã‚’å·¥å¤«ã—ãŸã‚Šé©åˆ‡ãªã‚¢ãƒ«ã‚´ãƒªã‚ºãƒ ã‚’é¸æŠžã—ãŸæ–¹ãŒé¥ã‹ã«ã‚ˆã„(id:tsubosaka ã•ã‚“ã‚‚å®Ÿé¨“ã•ã‚Œã¦ã„ãŸãŒ)ã€‚ãŸã¨ãˆãƒ‡ãƒ¼ã‚¿ãŒå¤§è¦æ¨¡ã§ã‚ã£ãŸã¨ã—ã¦ã‚‚ã€ãŸã¨ãˆã°å½¢æ…‹ç´ è§£æžãªã‚“ã‹ã®ã‚¿
ttakezawa 2010/06/14
research

algorithm

hadoop
ãƒªãƒ³ã‚¯
:: Ontology Matching ::
News OM-2024: CFP is out, the submission deadline is on August 9th, 2024. An ontology typically provides a vocabulary that describes a domain of interest and a specification of the meaning of terms used in the vocabulary. Depending on the precision of this specification, the notion of ontology encompasses several data/conceptual models, for example, classifications, database schemas, fully axiomat
ttakezawa 2010/06/02
research

graph
ãƒªãƒ³ã‚¯
ã‚¹ãƒšã‚¯ãƒˆãƒ©ãƒ«ã‚¯ãƒ©ã‚¹ã‚¿ãƒªãƒ³ã‚°ã¯æ¬¡å…ƒåœ§ç¸®ã—ãªãŒã‚‰Kmeansã™ã‚‹æ‰‹æ³• - æ¦è”µé‡Žæ—¥è¨˜
æ©Ÿæ¢°å¦ç¿’ç³»ã®ã‚¨ãƒ³ãƒˆãƒªã‚’ç¶šã‘ã¦æ›¸ã„ã¦ã¿ã‚‹ã€‚ã‚¯ãƒ©ã‚¹ã‚¿ãƒªãƒ³ã‚°ã«ã¤ã„ã¦çŸ¥ã‚‰ãªã„äººã¯ä»¥ä¸‹ã®ã‚¨ãƒ³ãƒˆãƒªèªã‚“ã§ã‚‚ã¡ã‚“ã·ã‚“ã‹ã‚“ã·ã‚“ã ã¨æ€ã†ã®ã§ã€ã‚¯ãƒ©ã‚¹ã‚¿ãƒªãƒ³ã‚°ã¨ã„ã†æ¦‚å¿µã«ã¤ã„ã¦ã¯çŸ¥ã£ã¦ã„ã‚‹ã‚‚ã®ã¨ã™ã‚‹ã€‚ ãã‚Œã§ã€ä»Šæ—¥ã¯ã‚¹ãƒšã‚¯ãƒˆãƒ©ãƒ«ã‚¯ãƒ©ã‚¹ã‚¿ãƒªãƒ³ã‚°ã®è©±ã€‚è‡ªç„¶è¨€èªžå‡¦ç†ä»¥å¤–ã§ã‚‚åˆ©ç”¨ã•ã‚Œã¦ã„ã‚‹ãŒã€ã“ã‚Œã¯ã‚°ãƒ©ãƒ•ã®ã‚¹ãƒšã‚¯ãƒˆãƒ«ã«åŸºã¥ãã‚¯ãƒ©ã‚¹ã‚¿ãƒªãƒ³ã‚°ã®æ‰‹æ³•ã§ã€åŠæ•™å¸«ã‚ã‚Šå¦ç¿’ã¸ã®æ‹¡å¼µãŒã‚„ã‚Šã‚„ã™ã„ã®ãŒåˆ©ç‚¹ã€‚ãªã«ã‚’ã™ã‚‹ã‹ã¨ã„ã†ã¨ã‚¯ãƒ©ã‚¹ã‚¿ãƒªãƒ³ã‚°ã‚’ã‚°ãƒ©ãƒ•ã®åˆ†å‰²å•é¡Œ(ç–Žã§ã‚ã‚‹ã‚¨ãƒƒã‚¸ã‚’ã‚«ãƒƒãƒˆ)ã«å¸°ç€ã—ã¦è§£ãæ‰‹æ³•ã§ã€ã©ã†ã„ã†ãµã†ã«åˆ†å‰²ã™ã‚‹ã‹ã«ã‚ˆã£ã¦ Normalized cut (Ncut) ã¨ã‹ Min-max cut (Mcut) ã¨ã‹ã„ã‚ã„ã‚ã‚ã‚‹ã€‚ å®Œå…¨ã«ã‚°ãƒ©ãƒ•ãŒåˆ†å‰²ã§ãã‚‹å ´åˆã¯ã“ã‚Œã§ã‚ã§ãŸã—ã‚ã§ãŸã—ãªã®ã ãŒã€å®Ÿä¸–ç•Œã®ã‚°ãƒ©ãƒ•ã¯ãã‚“ãªç°¡å˜ã«åˆ‡ã‚Œãªã„ã“ã¨ãŒå¾€ã€…ã«ã—ã¦ã‚ã‚‹ã€‚ãã‚Œã§è¿‘ä¼¼ã—ã¦ã“ã®ã‚°ãƒ©ãƒ•åˆ†å‰²å•é¡Œã‚’è§£ãã®ã ãŒã€Normalized c
ttakezawa 2010/05/21
research

clustering
ãƒªãƒ³ã‚¯
foaf-search.net
foaf-search.net 2025 è‘—ä½œæ¨©. ä¸è¨±è¤‡è£½ ãƒ—ãƒ©ã‚¤ãƒã‚·ãƒ¼ãƒãƒªã‚·ãƒ¼
ttakezawa 2010/05/21
foaf

research

searchengine

webservice
ãƒªãƒ³ã‚¯
CURRENT LAB: Social Networking Projects
#Research on Facebook, Twitter, and other OSNs Welcome. My group has been studying online social networks with a primary focus on Facebook and Twitter.Â Facebook is currently the largest online social network, with more than 360 million active users worldwide (February 2010).Â It is also an interesting and vibrant application platform for everything from shared Netflix reviews to Hugg and social
ttakezawa 2010/05/21
research

facebook

dataset

web
ãƒªãƒ³ã‚¯
ãƒ©ãƒ•é›†åˆ - Wikipedia
ãƒ©ãƒ•é›†åˆï¼ˆãƒ©ãƒ•ã—ã‚…ã†ã”ã†ã€Rough setsï¼‰ã¨ã¯ä¸Šè¿‘ä¼¼é›†åˆã¨ä¸‹è¿‘ä¼¼é›†åˆã‹ã‚‰ãªã‚‹é›†åˆã§ã€éžæ•°å€¤ã®å¯¾è±¡ã‚’ç²—ãï¼ˆãƒ©ãƒ•ã«ï¼‰è¨˜è¿°ã™ã‚‹ã“ã¨ãŒã§ãã‚‹ã‚‚ã®ã§ã‚ã‚‹ã€‚ã“ã‚Œã‚’ç”¨ã„ã‚‹ã“ã¨ã«ã‚ˆã£ã¦ã€ä»–ã®ãƒ‡ãƒ¼ã‚¿ãƒžã‚¤ãƒ‹ãƒ³ã‚°æ‰‹æ³•ã‹ã‚‰ã¯å¾—ã‚‰ã‚Œã«ãã„ã€éžæ•°å€¤ã§ã‚ã£ãŸã‚ŠçŸ›ç›¾ã®ã‚ã‚‹ã‚ˆã†ãªãƒ‡ãƒ¼ã‚¿ã‹ã‚‰ã®çŸ¥è˜ç²å¾—ãŒå¯èƒ½ã§ã‚ã‚‹ã€‚Rough sets theoryï¼ˆãƒ©ãƒ•é›†åˆç†è«–ï¼‰ã®é æ–‡å—ã‚’ã¨ã£ã¦ RST ã‚„ã€Rough sets approachï¼ˆãƒ©ãƒ•é›†åˆã‚¢ãƒ—ãƒãƒ¼ãƒï¼‰ã®é æ–‡å—ã‚’ã¨ã£ã¦ RSA ã¨ã‚‚å‘¼ã°ã‚Œã‚‹ã€‚ å¿œç”¨ã¨ã—ã¦ã€å¯¾è±¡é›†åˆã‚’ãƒ•ã‚¡ã‚¸ã‚£é›†åˆã«æ‹¡å¼µã—ãŸãƒ•ã‚¡ã‚¸ã‚£-ãƒ©ãƒ•é›†åˆç†è«– (Fuzzy-Rough sets theory) ã¨ã„ã†ã‚‚ã®ãŒã‚ã‚‹ã€‚
ttakezawa 2010/05/21
wikipedia

research
ãƒªãƒ³ã‚¯
Galway2020
Loading...
ttakezawa 2010/05/21
semanticweb

searchengine

web

webservice

research
ãƒªãƒ³ã‚¯
Tastes, Ties, and Time: Facebook data release | Berkman Klein Center
In collaboration with Harvard sociology graduate students Kevin Lewis and Marco Gonzalez, and with UCLA professor Andreas Wimmer and Harvard professor Nicholas Christakis, Berkman Fellow Jason Kaufman has made available a first wave of Facebook.com data through the Dataverse Network Project. The dataset comprises machine-readable files of virtually all the information posted on approximately 1,700
ttakezawa 2010/05/13
facebook

dataset

research
ãƒªãƒ³ã‚¯
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
ttakezawa 2010/05/13
research

dataset

network

nlp

web

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