2013 IEEE 14th International Conference on Information Reuse & Integration (IRI)最新文献_第9页

Adaptive association rule mining for web video event classification 基于自适应关联规则挖掘的web视频事件分类

2013 IEEE 14th International Conference on Information Reuse & Integration (IRI) Pub Date : 2013-08-01 DOI: 10.1109/IRI.2013.6642526

Chengde Zhang, Xiao Wu, M. Shyu, Qiang Peng

引用次数: 12

Interpreting random forest models using a feature contribution method 用特征贡献法解释随机森林模型

2013 IEEE 14th International Conference on Information Reuse & Integration (IRI) Pub Date : 2013-08-01 DOI: 10.1109/IRI.2013.6642461

Anna Palczewska, Jan Palczewski, R. M. Robinson, D. Neagu

引用次数: 56

Information reuse in dynamic spectrum access 动态频谱接入中的信息复用

2013 IEEE 14th International Conference on Information Reuse & Integration (IRI) Pub Date : 2013-08-01 DOI: 10.1109/IRI.2013.6642520

P. Krishnamurthy, M. Weiss, D. Tipper

{"title":"Information reuse in dynamic spectrum access","authors":"P. Krishnamurthy, M. Weiss, D. Tipper","doi":"10.1109/IRI.2013.6642520","DOIUrl":"https://doi.org/10.1109/IRI.2013.6642520","url":null,"abstract":"Dynamic spectrum access (DSA), where the permission to use slices of radio spectrum is dynamically shifted (in time an in different geographical areas) across various communications services and applications, has been an area of interest from technical and public policy perspectives over the last decade. The underlying belief is that this will increase spectrum utilization, especially since many spectrum bands are relatively unused, ultimately leading to the creation of new and innovative services that exploit the increase in spectrum availability. Determining whether a slice of spectrum, allocated or licensed to a primary user, is available for use by a secondary user at a certain time and in a certain geographic area is a challenging task. This requires “context information” which is critical to the operation of DSA. Such context information can be obtained in several ways, with different costs, and different quality/usefulness of the information. In this paper, we describe the challenges in obtaining this context information, the potential for the integration of various sources of context information, and the potential for reuse of such information for related and unrelated purposes such as localization and enforcement of spectrum sharing. Since some of the infrastructure for obtaining finegrained context information is likely to be expensive, the reuse of this infrastructure/information and integration of information from less expensive sources are likely to be essential for the economical and technological viability of DSA.","PeriodicalId":418492,"journal":{"name":"2013 IEEE 14th International Conference on Information Reuse & Integration (IRI)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122451612","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

Tag-based top-N recommendation using a pairwise topic model 使用成对主题模型的基于标签的top-N推荐

2013 IEEE 14th International Conference on Information Reuse & Integration (IRI) Pub Date : 2013-08-01 DOI: 10.1109/IRI.2013.6642450

Zhengyang Li, Congfu Xu

{"title":"Tag-based top-N recommendation using a pairwise topic model","authors":"Zhengyang Li, Congfu Xu","doi":"10.1109/IRI.2013.6642450","DOIUrl":"https://doi.org/10.1109/IRI.2013.6642450","url":null,"abstract":"Tagging systems enable users to organise their online entities with distinct tags. Exploiting these user generated content and underlying bilingual information have become more and more important in recommendation system. Probabilistic topic model has been widely used in document management and social network mining. In this paper, we propose a new method to do tag-based recommendation with topic model. Some existing methods are based on mining association rules and similarity measures. In these cases, tags serve as the essential intermediates for statistical computation, but they have the drawbacks that results are sensitive to parameter setup. Even though they are popular in some real application situations, they are simply lack of scalability as the computational procedure differs over distinguished platforms. It's natural to take tags as words, from which topics can be effectively extracted by using topic model. Under the assumption of the generating process in topic model, user's topic distribution parameter implies his or her topic preference. Recommendation results are obtained according to the final probability calculated by summing over topics. Our experiments show that the proposed model is effective to do both tags and items recommendation on two sparse datasets.","PeriodicalId":418492,"journal":{"name":"2013 IEEE 14th International Conference on Information Reuse & Integration (IRI)","volume":"37 4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131211023","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

Solving minimum cut based multi-label classification problem with semi-definite programming method 用半确定规划方法求解基于最小割的多标签分类问题

2013 IEEE 14th International Conference on Information Reuse & Integration (IRI) Pub Date : 2013-08-01 DOI: 10.1109/IRI.2013.6642459

Guangzhi Qu

引用次数: 0

Radiation therapy simulation and optimization using kinetic polygon modeling 基于动力学多边形建模的放射治疗模拟与优化

2013 IEEE 14th International Conference on Information Reuse & Integration (IRI) Pub Date : 2013-08-01 DOI: 10.1109/IRI.2013.6642478

David Allen, O. Daescu

{"title":"Radiation therapy simulation and optimization using kinetic polygon modeling","authors":"David Allen, O. Daescu","doi":"10.1109/IRI.2013.6642478","DOIUrl":"https://doi.org/10.1109/IRI.2013.6642478","url":null,"abstract":"Intensity modulated radiotherapy (IMRT) is a treatment for various cancers that involves applying a beam of radiation to diseased tumor cells. Although effective at destroying cancerous tissue, physicians must take care to avoid healthy tissues during the treatment plan as these may also be damaged. To improve treatment, computational methods are often employed to allow treatment planners to track the target tumor and apply radiation when it is less obstructed by healthy organs and tissues and thus more exposed to the beam, maximizing the damage to the diseased cells while minimizing the harm to healthy cells. Internal organs and tissues are rarely static, so this optimal time frame can be challenging to pinpoint. In this paper we develop a novel algorithm and accompanying data structure to determine the point in time at which the tumor target is most exposed. By modeling the organs and tumor as a set of moving polygons in the beam's eye view and using a kinetic data structure to track the level of exposure of the tumor as organs in the treatment area move, healthy tissue can be protected and the tumor can be targeted with greater effectiveness and precision, thus improving the overall quality of treatment.","PeriodicalId":418492,"journal":{"name":"2013 IEEE 14th International Conference on Information Reuse & Integration (IRI)","volume":"328 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122499416","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

ReadFast: Optimizing structural search relevance for big biomedical text ReadFast:优化大型生物医学文本的结构搜索相关性

2013 IEEE 14th International Conference on Information Reuse & Integration (IRI) Pub Date : 2013-08-01 DOI: 10.1109/IRI.2013.6642540

M. Gubanov, A. Pyayt

{"title":"ReadFast: Optimizing structural search relevance for big biomedical text","authors":"M. Gubanov, A. Pyayt","doi":"10.1109/IRI.2013.6642540","DOIUrl":"https://doi.org/10.1109/IRI.2013.6642540","url":null,"abstract":"While the problem to find needed information on the Web is critical, it is arguably much less pressing nowadays than it was over a decade ago when the Web was emerging. Back then it was much more difficult to find a Web resource of interest, because the search engines were in their infancy covering much lesser portion of the Web by their indices, armed with embryonic page ranking algorithms. Now, Web-search is by far not perfect yet, but definitely went a long way to become an everyday “go-to” resource for millions of people. By contrast, access to textual information is not even close to what Web-search algorithms offer today. In fact, it does not differ much from what everyone had a decade ago. That is keyword-search (exact substring match) is often the only way to find needle in a haystack in most modern word processors and text corpora search engines. Here we demonstrate ReadFast - a system, capable to extract certain structure from any natural language text corpus and use it to provide more relevant search results than keyword-search for specific classes of queries. Our evaluation justified significant relevance gain (20-30%) for two large Biomedical text corpora.","PeriodicalId":418492,"journal":{"name":"2013 IEEE 14th International Conference on Information Reuse & Integration (IRI)","volume":"67 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126925340","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

VFDS: Very fast database sampling system VFDS:非常快的数据库采样系统

2013 IEEE 14th International Conference on Information Reuse & Integration (IRI) Pub Date : 2013-08-01 DOI: 10.1109/IRI.2013.6642466

Teodora Sandra Buda, Thomas Cerqueus, John Murphy, Morten Kristiansen

{"title":"VFDS: Very fast database sampling system","authors":"Teodora Sandra Buda, Thomas Cerqueus, John Murphy, Morten Kristiansen","doi":"10.1109/IRI.2013.6642466","DOIUrl":"https://doi.org/10.1109/IRI.2013.6642466","url":null,"abstract":"In a wide range of application areas (e.g. data mining, approximate query evaluation, histogram construction), database sampling has proved to be a powerful technique. It is generally used when the computational cost of processing large amounts of information is extremely high, and a faster response with a lower level of accuracy for the results is preferred. Previous sampling techniques achieve this balance, however, an evaluation of the cost of the database sampling process should be considered. We argue that the performance of current relational database sampling techniques that maintain the data integrity of the sample database is low and a faster strategy needs to be devised. In this paper we propose a very fast sampling method that maintains the referential integrity of the sample database intact. The sampling method targets the production environment of a system under development, that generally consists of large amounts of data computationally costly to analyze. We evaluate our method in comparison with previous database sampling approaches and show that our method produces a sample database at least 300 times faster and with a maximum trade off of 0.5% in terms of sample size error.","PeriodicalId":418492,"journal":{"name":"2013 IEEE 14th International Conference on Information Reuse & Integration (IRI)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130973055","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

Porting mobile games in an aspect-oriented way: An industrial case study 以面向方面的方式移植手机游戏:一个工业案例研究

2013 IEEE 14th International Conference on Information Reuse & Integration (IRI) Pub Date : 2013-08-01 DOI: 10.1109/IRI.2013.6642506

Tanmay Bhowmik, Vander Alves, Nan Niu

引用次数: 1

Low power-energy storage system for energy harvesting applications 用于能量收集应用的低功耗储能系统

2013 IEEE 14th International Conference on Information Reuse & Integration (IRI) Pub Date : 2013-08-01 DOI: 10.1109/IRI.2013.6642530

Cody Tudor, Eric Sprung, Justin Meyer, Russ Tatro

引用次数: 2