Journal of Information Processing最新文献_第4页

A Study of the Steering Time Difference between Narrowing and Widening Circular Tunnels 圆形隧道加宽与缩窄转向时差的研究

Journal of Information Processing Pub Date : 2017-01-14 DOI: 10.11309/JSSST.33.4_116

Shota Yamanaka, Homei Miyashita

引用次数: 1

Detecting XSLT Rules Affected by DTD Updates 检测受DTD更新影响的XSLT规则

Journal of Information Processing Pub Date : 2017-01-01 DOI: 10.11185/IMT.12.103

Yang Wu, Nobutaka Suzuki

引用次数: 0

Unravel Programming Sessions with THRESHER: Identifying Coherent and Complete Sets of Fine-granular Source Code Changes 解开编程会话与脱粒机:识别一致和完整的集合细粒度源代码的变化

Journal of Information Processing Pub Date : 2017-01-01 DOI: 10.11185/IMT.12.24

Marcel Taeumel, Stephanie Platz, Bastian Steinert, R. Hirschfeld, H. Masuhara

引用次数: 9

Recognition of Sarcasm in Microblogging Based on Sentiment Analysis and Coherence Identification 基于情感分析和连贯识别的微博讽刺语识别

Journal of Information Processing Pub Date : 2016-12-15 DOI: 10.11185/IMT.12.80

Piyoros Tungthamthiti, Kiyoaki Shirai, M. Mohd

{"title":"Recognition of Sarcasm in Microblogging Based on Sentiment Analysis and Coherence Identification","authors":"Piyoros Tungthamthiti, Kiyoaki Shirai, M. Mohd","doi":"10.11185/IMT.12.80","DOIUrl":"https://doi.org/10.11185/IMT.12.80","url":null,"abstract":"Recognition of sarcasm in microblogging is important in a range of NLP applications, such as opinion mining. However, this is a challenging task, as the real meaning of a sarcastic sentence is the opposite of the literal meaning. Furthermore, microblogging messages are short and usually written in a free style that may include misspellings, grammatical errors, and complex sentence structures. This paper proposes a novel method for identifying sarcasm in tweets. It combines two supervised classifiers, a Support Vector Machine (SVM) using N-gram features and an SVM using our proposed features. Our features represent the intensity and contradictions of sentiment in a tweet, derived by sentiment analysis. The sentiment contradiction feature also considers coherence among multiple sentences in the tweet, and this is automatically identified by our proposed method using unsupervised clustering and an adaptive genetic algorithm. Furthermore, a method for identifying the concepts of unknown sentiment words is used to compensate for gaps in the sentiment lexicon. Our method also considers punctuation and the special symbols that are frequently used in Twitter messaging. Experiments using two datasets demonstrated that our proposed system outperformed baseline systems on one dataset, while producing comparable results on the other. Accuracy of 82% and 76% was achieved in sarcasm identification on the two datasets.","PeriodicalId":16243,"journal":{"name":"Journal of Information Processing","volume":"12 1","pages":"80-102"},"PeriodicalIF":0.0,"publicationDate":"2016-12-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"63625915","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 10

Exploring the Social Bonding That Evolves Between a Human and a Minimally Designed Accompanying Robot 探索人类与最小设计陪伴机器人之间的社会联系

Journal of Information Processing Pub Date : 2016-08-25 DOI: 10.11185/IMT.11.250

K. Youssef, M. Okada

引用次数: 1

A Generalized Dependency Tree Language Model for SMT 面向SMT的广义依赖树语言模型

Journal of Information Processing Pub Date : 2016-06-15 DOI: 10.5715/JNLP.23.299

John Richardson, Taku Kudo, H. Kazawa, S. Kurohashi

引用次数: 3

Chinese Word Segmentation and Unknown Word Extraction by Mining Maximized Substring 基于最大子串挖掘的中文分词与未知词提取

Journal of Information Processing Pub Date : 2016-06-15 DOI: 10.5715/JNLP.23.235

Mo Shen, Daisuke Kawahara, S. Kurohashi

{"title":"Chinese Word Segmentation and Unknown Word Extraction by Mining Maximized Substring","authors":"Mo Shen, Daisuke Kawahara, S. Kurohashi","doi":"10.5715/JNLP.23.235","DOIUrl":"https://doi.org/10.5715/JNLP.23.235","url":null,"abstract":"Chinese word segmentation is an initial and important step in Chinese language processing. Recent advances in machine learning techniques have boosted the performance of Chinese word segmentation systems, yet the identiﬁcation of out-of-vocabulary words is still a major problem in this ﬁeld of study. Recent research has attempted to address this problem by exploiting characteristics of frequent substrings in unlabeled data. We propose a simple yet eﬀective approach for extracting a speciﬁc type of frequent substrings, called maximized substrings, which provide good estimations of unknown word boundaries. In the task of Chinese word segmentation, we use these substrings which are extracted from large scale unlabeled data to improve the segmentation accuracy. The eﬀectiveness of this approach is demonstrated through experiments using various data sets from diﬀerent domains. In the task of unknown word extraction, we apply post-processing techniques that eﬀectively reduce the noise in the extracted substrings. We demonstrate the eﬀectiveness and eﬃciency of our approach by comparing the results with a widely applied Chinese word recognition method in a previous study.","PeriodicalId":16243,"journal":{"name":"Journal of Information Processing","volume":"23 1","pages":"235-266"},"PeriodicalIF":0.0,"publicationDate":"2016-06-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.5715/JNLP.23.235","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"71087619","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 5

Stable Load Balancing with Overlapping ID-space Management in Range-based Structured Overlay Networks 基于距离的结构化覆盖网络中具有重叠id空间管理的稳定负载均衡

Journal of Information Processing Pub Date : 2016-01-01 DOI: 10.11185/IMT.11.1

Kimihiro Mizutani, Takeru Inoue, Toru Mano, Osamu Akashi, S. Matsuura, K. Fujikawa

{"title":"Stable Load Balancing with Overlapping ID-space Management in Range-based Structured Overlay Networks","authors":"Kimihiro Mizutani, Takeru Inoue, Toru Mano, Osamu Akashi, S. Matsuura, K. Fujikawa","doi":"10.11185/IMT.11.1","DOIUrl":"https://doi.org/10.11185/IMT.11.1","url":null,"abstract":"Structured overlay networks that support range queries cannot hash data IDs for load balancing, in order to preserve the total order on the IDs. Since data and queries are not equally distributed on the ID-space without hashing in range-based overlay networks, uneven loads are imposed on the overlay nodes. Existing load balancing techniques for range-based overlay networks distribute the loads by using data reallocation or node migration, which makes the networks very unstable due to heavy data reallocation or frequent churn. This paper proposes a novel scheme that distributes, fairly, the loads without node migration and with little data reallocation, by sharing some ID-space regions between neighboring nodes. Our “overlapping” ID-space management scheme derives the optimal overlap based on kernel density estimations; the query loads based on the statistical theory are used to calculate the best overlap regions. This calculation is executed in a distributed manner with no central coordinator. We conduct thorough computer simulations, and show that our scheme alleviates the worst node load by 20–90 % against existing techniques without node migration and with least data reallocation.","PeriodicalId":16243,"journal":{"name":"Journal of Information Processing","volume":"20 1","pages":"1-10"},"PeriodicalIF":0.0,"publicationDate":"2016-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"63626108","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 4

Heading-Aware Proximity Measure and Its Application to Web Search 标题感知接近测度及其在网络搜索中的应用

Journal of Information Processing Pub Date : 2016-01-01 DOI: 10.11185/IMT.11.154

Tomohiro Manabe, Keishi Tajima

{"title":"Heading-Aware Proximity Measure and Its Application to Web Search","authors":"Tomohiro Manabe, Keishi Tajima","doi":"10.11185/IMT.11.154","DOIUrl":"https://doi.org/10.11185/IMT.11.154","url":null,"abstract":"Proximity of query keyword occurrences is one important evidence which is useful for effective querybiased document scoring. If a query keyword occurs close to another in a document, it suggests high relevance of the document to the query. The simplest way to measure proximity between keyword occurrences is to use distance between them, i.e., difference of their positions. However, most web pages contain hierarchical structure composed of nested logical blocks with their headings, and it affects logical proximity. For example, if a keyword occurs in a block and another occurs in the heading of the block, we should not simply measure their proximity by their distance. This is because a heading describes the topic of the entire corresponding block, and term occurrences in a heading are strongly connected with any term occurrences in its associated block with less regard for the distance between them. Based on these observations, we developed a heading-aware proximity measure and applied it to three existing proximity-aware document scoring methods: MinDist, P6, and Span. We evaluated these existing methods and our modified methods on the data sets from TREC web tracks. The results indicate that our heading-aware proximity measure is better than the simple distance in all cases, and the method combining it with the Span method achieved the best performance.","PeriodicalId":16243,"journal":{"name":"Journal of Information Processing","volume":"11 1","pages":"154-159"},"PeriodicalIF":0.0,"publicationDate":"2016-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"63626168","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Survey on Mechanisms for Live Virtual Machine Migration and its Improvements 动态虚拟机迁移机制及其改进研究

Journal of Information Processing Pub Date : 2016-01-01 DOI: 10.11185/IMT.11.101

H. Yamada

引用次数: 7