Sixth IEEE International Conference on Data Mining - Workshops (ICDMW'06)最新文献

筛选
英文 中文
Theoretical and Experimental Study of a Meta-Typicalness Approach for Reliable Classification 可靠分类的元典型性方法的理论与实验研究
Sixth IEEE International Conference on Data Mining - Workshops (ICDMW'06) Pub Date : 2006-12-18 DOI: 10.1109/ICDMW.2006.158
E. Smirnov, A. Kaptein
{"title":"Theoretical and Experimental Study of a Meta-Typicalness Approach for Reliable Classification","authors":"E. Smirnov, A. Kaptein","doi":"10.1109/ICDMW.2006.158","DOIUrl":"https://doi.org/10.1109/ICDMW.2006.158","url":null,"abstract":"The authors propose a meta-typicalness approach to apply the typicalness framework for any type of classifiers. The approach can be used to construct classifiers with specified classification performance. Experiments show that the approach results in classifiers that can outperform an existing typicalness-based classifier","PeriodicalId":291862,"journal":{"name":"Sixth IEEE International Conference on Data Mining - Workshops (ICDMW'06)","volume":"497 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-12-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121560065","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}
引用次数: 13
Cascaded Data Mining Methods for Text Understanding, with medical case study 用于文本理解的级联数据挖掘方法,包括医学案例研究
Sixth IEEE International Conference on Data Mining - Workshops (ICDMW'06) Pub Date : 2006-12-18 DOI: 10.1109/ICDMW.2006.38
Roni Romano, L. Rokach, O. Maimon
{"title":"Cascaded Data Mining Methods for Text Understanding, with medical case study","authors":"Roni Romano, L. Rokach, O. Maimon","doi":"10.1109/ICDMW.2006.38","DOIUrl":"https://doi.org/10.1109/ICDMW.2006.38","url":null,"abstract":"Substantial electronically stored textual data such as clinical narratives reports often need to be retrieved to find relevant information for clinical and research purposes. The context of negation, a negative finding, is of special importance, since many of the most frequently described findings are such. Hence, when searching free-text narratives for patients with a certain medical condition, if negation is not taken into account, many of the documents retrieved were irrelevant. We present a new cascaded pattern learning method for automatic identification of negative context in clinical narratives reports. Studying the training corpuses, the classification errors and patterns selected by the classifier, we noticed that it is possible to create a more powerful ensemble structure than the structure obtained from general-purpose ensemble method (such as Adaboost). We compare the new algorithm to previous methods proposed for the same task of similar medical narratives, and show its advantages: accuracy improvement compared to other machine learning methods, and much faster than manual knowledge engineering techniques with matching accuracy","PeriodicalId":291862,"journal":{"name":"Sixth IEEE International Conference on Data Mining - Workshops (ICDMW'06)","volume":"61 7","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-12-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114003791","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}
引用次数: 3
A Hybrid Strategy for Clustering Data Mining Documents 数据挖掘文档聚类的混合策略
Sixth IEEE International Conference on Data Mining - Workshops (ICDMW'06) Pub Date : 2006-12-18 DOI: 10.1109/ICDMW.2006.6
Yi Peng, Gang Kou, Yong Shi, Zhengxin Chen
{"title":"A Hybrid Strategy for Clustering Data Mining Documents","authors":"Yi Peng, Gang Kou, Yong Shi, Zhengxin Chen","doi":"10.1109/ICDMW.2006.6","DOIUrl":"https://doi.org/10.1109/ICDMW.2006.6","url":null,"abstract":"With the increase in the number of electronic documents, it is hard to manually organize, analyze and present these documents efficiently. Document clustering, which automatically groups similar or related documents together, has been used in practical applications to understand the contents and structures of documents. Although a variety of methods and algorithms have been proposed, it is still a challenging task to generate meaningful document clusters. This paper uses an approach that combines quantitative and qualitative methods in order to create high-quality clusters for a collection of data mining and knowledge discovery (DMKD) publications. The quantitative method extracts a list of noun/noun phrases from the DMKD documents and uses an optimization procedure from CLUTO toolkit to assign documents to clusters. The qualitative method uses grounded theory to identify major categories of the documents to improve the comprehensibility of resultant clusters. The results demonstrate that the strategy produces more meaningful clusters than single-term k-way clustering algorithm in terms of internal metrics and human assessment","PeriodicalId":291862,"journal":{"name":"Sixth IEEE International Conference on Data Mining - Workshops (ICDMW'06)","volume":"76 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-12-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126202397","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}
引用次数: 6
Feature Subset Selection on Multivariate Time Series with Extremely Large Spatial Features 具有超大空间特征的多元时间序列特征子集选择
Sixth IEEE International Conference on Data Mining - Workshops (ICDMW'06) Pub Date : 2006-12-18 DOI: 10.1109/ICDMW.2006.81
Hyunjin Yoon, C. Shahabi
{"title":"Feature Subset Selection on Multivariate Time Series with Extremely Large Spatial Features","authors":"Hyunjin Yoon, C. Shahabi","doi":"10.1109/ICDMW.2006.81","DOIUrl":"https://doi.org/10.1109/ICDMW.2006.81","url":null,"abstract":"Several spatio-temporal data collected in many applications, such as fMRI data in medical applications, can be represented as a multivariate time series (MTS) matrix with m rows (capturing the spatial features) and n columns (capturing the temporal observations). Any data mining task such as clustering or classification on MTS datasets are usually hindered by the large size (i.e., dimensions) of these MTS items. In order to reduce the dimensions without losing the useful discriminative features of the dataset, feature selection techniques are usually preferred by domain experts since the relation of the selected subset of features to the originally acquired features is maintained. In this paper, we propose a new feature selection technique for MTS datasets where their spatial features (i.e., number of rows) are much larger than their temporal observations (i.e., number of columns), or m Gt n. Our approach is based on principal component analysis, recursive feature elimination and support vector machines. Our empirical results on real-world datasets show that our technique significantly outperforms the closest competitor technique","PeriodicalId":291862,"journal":{"name":"Sixth IEEE International Conference on Data Mining - Workshops (ICDMW'06)","volume":"116 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-12-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128002695","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}
引用次数: 21
Asset Valuation Technique for Network Management and Security 网络管理与安全中的资产评估技术
Sixth IEEE International Conference on Data Mining - Workshops (ICDMW'06) Pub Date : 2006-12-18 DOI: 10.1109/ICDMW.2006.32
L. Beaudoin, P. Eng
{"title":"Asset Valuation Technique for Network Management and Security","authors":"L. Beaudoin, P. Eng","doi":"10.1109/ICDMW.2006.32","DOIUrl":"https://doi.org/10.1109/ICDMW.2006.32","url":null,"abstract":"One of the most difficult tasks for analysts working in Network Operation Centres is to evaluate the impact of the loss of a given asset. This paper proposes a new technique to evaluate such a value using a simple model and computation. The resulting value for each network asset represents its contribution to the value delivery chain. This value can be used to evaluate the impact of vulnerabilities, malicious and non-malicious incidents, and is a keystone to automating risk assessment","PeriodicalId":291862,"journal":{"name":"Sixth IEEE International Conference on Data Mining - Workshops (ICDMW'06)","volume":"47 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-12-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115945210","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}
引用次数: 15
Mining and Predicting Duplication over Peer-to-Peer Query Streams 点对点查询流的重复挖掘和预测
Sixth IEEE International Conference on Data Mining - Workshops (ICDMW'06) Pub Date : 2006-12-18 DOI: 10.1109/ICDMW.2006.109
S. Meng, Yifeng Shao, Congcong Shi, Dingyi Han, Yong Yu
{"title":"Mining and Predicting Duplication over Peer-to-Peer Query Streams","authors":"S. Meng, Yifeng Shao, Congcong Shi, Dingyi Han, Yong Yu","doi":"10.1109/ICDMW.2006.109","DOIUrl":"https://doi.org/10.1109/ICDMW.2006.109","url":null,"abstract":"Many previous works of data mining user queries in peer-to-peer systems focused their attention on the distribution of query contents. However, few has been done towards a better understanding of the time series distribution of these queries, which is vital for system performance. To remedy this situation, this paper mines query steams by using automatic time series analysis to evaluate different linear models (Box-Jenkins models and some simple windowed-mean models) for predicting the number of duplicated queries from 10 minutes to 2 hours into the future. Both the predictive power and the computational costs of these models are evaluated over 318,942,450 real world Gnutella queries collected over 3 months. We find the number of duplicated queries is consistently predictable. Simple, practical models like AR perform well on prediction","PeriodicalId":291862,"journal":{"name":"Sixth IEEE International Conference on Data Mining - Workshops (ICDMW'06)","volume":"278 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-12-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134449385","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
Discovering Frequent Poly-Regions in DNA Sequences 发现DNA序列中的频繁多聚区
Sixth IEEE International Conference on Data Mining - Workshops (ICDMW'06) Pub Date : 2006-12-18 DOI: 10.1109/ICDMW.2006.63
P. Papapetrou, Gary Benson, G. Kollios
{"title":"Discovering Frequent Poly-Regions in DNA Sequences","authors":"P. Papapetrou, Gary Benson, G. Kollios","doi":"10.1109/ICDMW.2006.63","DOIUrl":"https://doi.org/10.1109/ICDMW.2006.63","url":null,"abstract":"The problem of discovering arrangements of regions of high occurrence of one or more items of a given alphabet in a sequence is studied, and two efficient algorithms are proposed. The first one is entropy-based and uses an existing recursive segmentation technique to split the input sequence into a set of homogeneous segments. The key idea of the second approach is to use a set of sliding windows over the sequence. Each sliding window keeps a set of statistics of a sequence segment that mainly includes the number of occurrences of each item in that segment. Combining these statistics efficiently yields the complete set of regions of high occurrence of the items of the given alphabet. After identifying these regions, the sequence is converted to a sequence of labeled intervals (each one corresponding to a region). An efficient algorithm for mining frequent arrangements of event intervals is applied to the converted sequence to discover frequently occurring arrangements of these regions. The proposed algorithms are tested on various DNA sequences producing results with significant biological meaning","PeriodicalId":291862,"journal":{"name":"Sixth IEEE International Conference on Data Mining - Workshops (ICDMW'06)","volume":"6 4","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-12-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132870421","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}
引用次数: 13
The Role of Domain Ontology in Text Mining Applications: The ADDMiner Project 领域本体在文本挖掘应用中的作用:ADDMiner项目
Sixth IEEE International Conference on Data Mining - Workshops (ICDMW'06) Pub Date : 2006-12-18 DOI: 10.1109/ICDMW.2006.157
A. C. Garcia, I. N. Ferraz, F. B. Pinto
{"title":"The Role of Domain Ontology in Text Mining Applications: The ADDMiner Project","authors":"A. C. Garcia, I. N. Ferraz, F. B. Pinto","doi":"10.1109/ICDMW.2006.157","DOIUrl":"https://doi.org/10.1109/ICDMW.2006.157","url":null,"abstract":"Extracting insights from large text collections is an aspiration of any organization aiming to take advantage of their experience generally documented in textual documents. Textual documents, either digital or not, have been the most common form to register any organization transaction. Free text style is a very easy way to input data since it does not require users any special training. On the other hand, the text material easily collected becomes the major challenge for building automatic deciphering tools. In this paper we present ADDMiner, a text-mining model for extracting causality relationships from a large text collection of accident reports. Our model is based on using domain ontology as well as a corpus-based computational linguistics to guide the mining process. Examples from offshore oil platform accident reports illustrate the potential benefits of our approach","PeriodicalId":291862,"journal":{"name":"Sixth IEEE International Conference on Data Mining - Workshops (ICDMW'06)","volume":"60 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-12-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115803549","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}
引用次数: 8
An Evaluation of Progressive Sampling for Imbalanced Data Sets 不平衡数据集渐进式抽样的评价
Sixth IEEE International Conference on Data Mining - Workshops (ICDMW'06) Pub Date : 2006-12-18 DOI: 10.1109/ICDMW.2006.28
Willie Ng, M. Dash
{"title":"An Evaluation of Progressive Sampling for Imbalanced Data Sets","authors":"Willie Ng, M. Dash","doi":"10.1109/ICDMW.2006.28","DOIUrl":"https://doi.org/10.1109/ICDMW.2006.28","url":null,"abstract":"One of the emerging challenges for the data mining research community is to allow learning algorithms to mine huge databases. Sampling has often been suggested as an effective way to circumvent memory limitations as well as to improve processing speed. In this paper, we study the learning-curve sampling method, an approach for applying machine learning algorithms to massive amount of data sets. We show that a naive application of progressive sampling on data sets with highly imbalanced class distributions is often not very effective for training a learning algorithm. We then present a refinement for progressive sampling which works well in practice and is able to converge to the desired sample size very quickly and accurately. Empirical results on a number of large data sets show that our approach is able to enhance its performance","PeriodicalId":291862,"journal":{"name":"Sixth IEEE International Conference on Data Mining - Workshops (ICDMW'06)","volume":"215 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-12-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114847847","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}
引用次数: 30
Mining Closed and Maximal Frequent Induced Free Subtrees 挖掘闭合和最大频繁诱导自由子树
Sixth IEEE International Conference on Data Mining - Workshops (ICDMW'06) Pub Date : 2006-12-18 DOI: 10.1109/ICDMW.2006.111
Hitohiro Shiozaki, Tomonobu Ozaki, T. Ohkawa
{"title":"Mining Closed and Maximal Frequent Induced Free Subtrees","authors":"Hitohiro Shiozaki, Tomonobu Ozaki, T. Ohkawa","doi":"10.1109/ICDMW.2006.111","DOIUrl":"https://doi.org/10.1109/ICDMW.2006.111","url":null,"abstract":"Mining frequent tree patterns is an important problem, since tree structures are used in various fields such as computational biology, XML databases, and so on. However, mining all frequent subtrees is sometimes infeasible because of the combinatorial explosion. In this paper, by combining an efficient algorithm for enumerating free trees and the pruning techniques for mining closed and maximal rooted trees, we present an efficient algorithm named CMFree-TreeMiner that discovers only closed and maximal frequent induced free subtrees in a database of labeled free trees. Experimental results show the effectiveness of the proposed algorithm","PeriodicalId":291862,"journal":{"name":"Sixth IEEE International Conference on Data Mining - Workshops (ICDMW'06)","volume":"72 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-12-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114709663","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}
引用次数: 3
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学术官方微信
小红书