Proceedings of the 18th International Conference on Information Integration and Web-based Applications and Services最新文献

筛选
英文 中文
Automated detection and guessing without semantics of sender-receiver relations in computer-mediated discourses 计算机中介语篇中无语义的收发关系自动检测与猜测
R. Ecker
{"title":"Automated detection and guessing without semantics of sender-receiver relations in computer-mediated discourses","authors":"R. Ecker","doi":"10.1145/3011141.3011175","DOIUrl":"https://doi.org/10.1145/3011141.3011175","url":null,"abstract":"Automated tools for discourse analysis process tremendous amounts of computer-mediated discourses in a fast way. Assigning receivers to each message is an important step to answer the question \"Who is communicating with whom\" at any time. Direct addressing helps but is not used in every message. The focus of this paper is mainly split into two parts. First, automated detection and mapping of written receivers (or parts of them) to logged-in users. Second, if no receiver is written, automated receiver guessing without semantics. The architecture of the automated software is described in detail. As an applied example, the well-known and text-based chat system Internet Relay Chat (IRC) is used. An IRC discourse with 5605 messages is manually and automatically analyzed for comparing both approaches. Both - detection and guessing - are similarly well done as by hand.","PeriodicalId":247823,"journal":{"name":"Proceedings of the 18th International Conference on Information Integration and Web-based Applications and Services","volume":"104 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-11-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123613390","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
Mission-oriented large-scale environment sensing based on analogy of military system 基于军事系统类比的面向任务的大尺度环境感知
Hikaru Inomoto, S. Saiki, Masahide Nakamura, S. Matsumoto
{"title":"Mission-oriented large-scale environment sensing based on analogy of military system","authors":"Hikaru Inomoto, S. Saiki, Masahide Nakamura, S. Matsumoto","doi":"10.1145/3011141.3011148","DOIUrl":"https://doi.org/10.1145/3011141.3011148","url":null,"abstract":"As typically seen in Smart City, emerging technologies enable large-scale environment sensing using IoT devices deployed in a wide area. From the viewpoint of cost and efficiency, infrastructure of the large-scale environment sensing should be shared by multiple applications, with dynamically adapting the sensing behavior for different purposes. To achieve this, the infrastructure must implement a clever method that can command and control a lot of IoT devices in good order. To implement such multi-purpose large-scale environment sensing, we introduce an analogy of military system. Specifically, we propose a mission-oriented sensing with army hierarchy, where individual IoT devices and their dynamic purposes are regarded as soldiers and missions, respectively.","PeriodicalId":247823,"journal":{"name":"Proceedings of the 18th International Conference on Information Integration and Web-based Applications and Services","volume":"42 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-11-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121352822","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}
引用次数: 1
Who are growth users?: analyzing and predicting intended Twitter user growth 谁是成长型用户?:分析和预测Twitter用户预期增长
Shuhei Yamamoto, Kei Wakabayashi, N. Kando, T. Satoh
{"title":"Who are growth users?: analyzing and predicting intended Twitter user growth","authors":"Shuhei Yamamoto, Kei Wakabayashi, N. Kando, T. Satoh","doi":"10.1145/3011141.3011145","DOIUrl":"https://doi.org/10.1145/3011141.3011145","url":null,"abstract":"Twitter reflects events and trends in users' real lives because many of them post tweets related to their experiences. Many studies have succeeded in detecting events such as earthquakes and influenza epidemics, along with real-life information from a large amount of tweets, by assuming users as social sensors. On the other hand, inactive users who don't engage in posting activity, are increasing according as time progresses. To collect a large amount of tweets based on specific users for successful Twitter studies, we have to know the characteristics of users who are active over long periods of time. In this paper, we clarify the characteristics of growth users over a long time to strategically collect a large amount of specific users' tweets. We explore the status of users who were active in 2012, and classify users into three statuses of Dead, Lock, and Alive. Based on the differences between the numbers of tweets in 2012 and 2016, we further classify alive users into three types of Eraser, Slumber, and Growth. We analyze the characteristic feature values observed in each user behavior and provide interesting findings with each status/type based on GMM clustering and point-wise mutual information. Finally, we propose a growth user prediction method by a simple formula consisting of feature values and evaluate the effectiveness. We found that active users more easily dropped out than inactive users, and users who engaged in reciprocal communications by replies and retweets often became Growth type.","PeriodicalId":247823,"journal":{"name":"Proceedings of the 18th International Conference on Information Integration and Web-based Applications and Services","volume":"114 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-11-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124179845","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}
引用次数: 1
GeTCo: an ontology-based approach for patent classification search 基于本体的专利分类检索方法
Hoang-Minh Nguyen, Cong-Phuoc Phan, Hong-Quang Nguyen
{"title":"GeTCo: an ontology-based approach for patent classification search","authors":"Hoang-Minh Nguyen, Cong-Phuoc Phan, Hong-Quang Nguyen","doi":"10.1145/3011141.3011205","DOIUrl":"https://doi.org/10.1145/3011141.3011205","url":null,"abstract":"The main contribution of this paper is a method for creating a Graph-Embedded-Tree-based ontology, which utilizes domain knowledge from a patent classification scheme, for a patent classification process. Our contribution is twofold. First, we propose a novel definition of GeTCo ontology, which consists of four types of concept: Class, Document, Phrase, and Term. Depending on relationships of each pair of concepts, we further define their semantic information to give our classifier better reasoning capability whenever the semantic ambiguation occurs. Second, we propose a novel method to construct our ontology based on the United State Patent Classification Scheme (USPC) without relying on a rule-based method for concept extraction and thus, it can negate intensive-manual efforts in traditional ontology construction. We developed a prototype application on top of Rocchio classifier, called the GeTCo-enabled Rocchio classifier, to evaluate our proposed ontology. Our experiments with filtered 9703 single-class patents showed that the GeTCo-enabled Rocchio classifier, backed by our proposed directed-graph ontology, yields higher F1-score (i.e., +7%) than original Rocchio classifier without GeTCo supports.","PeriodicalId":247823,"journal":{"name":"Proceedings of the 18th International Conference on Information Integration and Web-based Applications and Services","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-11-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126340617","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}
引用次数: 2
Efficient web harvesting strategies for monitoring deep web content 监测深层网络内容的有效网络收获策略
Mohammadreza Khelghati, D. Hiemstra, M. V. Keulen
{"title":"Efficient web harvesting strategies for monitoring deep web content","authors":"Mohammadreza Khelghati, D. Hiemstra, M. V. Keulen","doi":"10.1145/3011141.3011198","DOIUrl":"https://doi.org/10.1145/3011141.3011198","url":null,"abstract":"Web content changes rapidly [18]. In Focused Web Harvesting [17] which aim it is to achieve a complete harvest for a given topic, this dynamic nature of the web creates problems for users who need to access a set of all the relevant web data to their topics of interest. Whether you are a fan following your favorite idol or a journalist investigating a topic, you may need not only to access all the relevant information but also the recent changes and updates. General search engines like Google apply several techniques to enhance the freshness of their crawled data. However, in focused web harvesting, we lack an efficient approach that detects changes for a given topic over time. In this paper, we focus on techniques that can keep the relevant content to a given query up-to-date. To do so, we test four different approaches to efficiently harvest all the changed documents matching a given entity by querying web search engines. We define a document with changed content or a newly created or removed document as a changed document. Among the proposed change detection approaches, the FedWeb method outperforms the other approaches in finding the changed content on the web for a given query with 20 percent, on average, better performance.","PeriodicalId":247823,"journal":{"name":"Proceedings of the 18th International Conference on Information Integration and Web-based Applications and Services","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-05-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132484252","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
Proceedings of the 18th International Conference on Information Integration and Web-based Applications and Services 第十八届信息集成与基于网络的应用与服务国际会议论文集
{"title":"Proceedings of the 18th International Conference on Information Integration and Web-based Applications and Services","authors":"","doi":"10.1145/3011141","DOIUrl":"https://doi.org/10.1145/3011141","url":null,"abstract":"","PeriodicalId":247823,"journal":{"name":"Proceedings of the 18th International Conference on Information Integration and Web-based Applications and Services","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129772829","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
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信