2014 IEEE International Conference on Data Mining Workshop最新文献

筛选
英文 中文
SUBSCALE: Fast and Scalable Subspace Clustering for High Dimensional Data SUBSCALE:高维数据的快速可伸缩子空间聚类
2014 IEEE International Conference on Data Mining Workshop Pub Date : 2014-12-01 DOI: 10.1109/ICDMW.2014.100
Amardeep Kaur, A. Datta
{"title":"SUBSCALE: Fast and Scalable Subspace Clustering for High Dimensional Data","authors":"Amardeep Kaur, A. Datta","doi":"10.1109/ICDMW.2014.100","DOIUrl":"https://doi.org/10.1109/ICDMW.2014.100","url":null,"abstract":"The aim of subspace clustering is to find groups of similar data points in all possible subspaces of a dataset. Since the number of subspaces is exponential in dimensions, subspace clustering is usually computationally very expensive. The performance of existing algorithms deteriorates drastically with the increase in number of dimensions. Most of them use bottom-up search strategy and there are two main reasons for their inefficiency: (1) Multiple database scans. (2) Either implicit or explicit generation of trivial subspace clusters during the process. We present SUBSCALE, a novel algorithm to directly find the non-trivial subspace clusters with minimal cost and it requires only k database scans for a k-dimensional data set. Our algorithm scales very well with the dimensionality and is highly parallelizable. The experimental evaluation has shown promising results.","PeriodicalId":289269,"journal":{"name":"2014 IEEE International Conference on Data Mining Workshop","volume":"02 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124491114","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}
引用次数: 7
RepComment: A Fair Comment-Sentiment Representation System RepComment:一个公平的评论情感表达系统
2014 IEEE International Conference on Data Mining Workshop Pub Date : 2014-12-01 DOI: 10.1109/ICDMW.2014.22
Ting Wu, Chunxi Tan, Ming Cheung, P. Hui
{"title":"RepComment: A Fair Comment-Sentiment Representation System","authors":"Ting Wu, Chunxi Tan, Ming Cheung, P. Hui","doi":"10.1109/ICDMW.2014.22","DOIUrl":"https://doi.org/10.1109/ICDMW.2014.22","url":null,"abstract":"Most Online Social Networks (OSNs) allow registered members to leave comments on particular entities. An entity can either be a person, a location, or a product. These comments have already become an important reference for many people in the daily life. However, a popular entity usually receives an extensive number of comments and it has become infeasible for users to read through all of them. In this demonstration, we propose Rep Comment, a fair comment-sentiment representation system based on a novel probability sampling model that can choose a small set of comments (samples) that are most resemble and representative for the original comment set. The proposed approximation algorithm significantly reduces the computation cost of the sampling problem while keeping relatively high accuracy.","PeriodicalId":289269,"journal":{"name":"2014 IEEE International Conference on Data Mining Workshop","volume":"55 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126405416","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
Online Fusion of Incremental Learning for Wireless Sensor Networks 无线传感器网络增量学习的在线融合
2014 IEEE International Conference on Data Mining Workshop Pub Date : 2014-12-01 DOI: 10.1109/ICDMW.2014.79
H. H. W. J. Bosman, Giovanni Iacca, H. Wörtche, A. Liotta
{"title":"Online Fusion of Incremental Learning for Wireless Sensor Networks","authors":"H. H. W. J. Bosman, Giovanni Iacca, H. Wörtche, A. Liotta","doi":"10.1109/ICDMW.2014.79","DOIUrl":"https://doi.org/10.1109/ICDMW.2014.79","url":null,"abstract":"Ever-more ubiquitous embedded systems provide us with large amounts of data. Performing analysis close to the data source allows for data reduction while giving information when unexpected behavior (i.e. Anomalies in the system under observation) occurs. This work presents a novel approach to online anomaly detection, based on an ensemble of classifiers that can be executed on distributed embedded systems. We consider both single and multi-dimensional input classifiers that are based on prediction errors. Predictions of single-dimensional time series input come from either a linear function model or general statistics over a data window. Multi-dimensional input stems from current and historical sensor values as well as predictions. We combine the classifier outputs in the ensemble using a heuristic method and Fisher's combined probability test. The proposed framework is tested thoroughly using synthetic and real-world data. The results are compared to known methods for anomaly detection on limited-resource systems. While individual classifiers perform comparably to known methods, our results show that using an ensemble of classifiers increases the overall detection of anomalies considerably.","PeriodicalId":289269,"journal":{"name":"2014 IEEE International Conference on Data Mining Workshop","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125457589","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
Latent Factor SVM for Text Categorization 文本分类的潜在因子支持向量机
2014 IEEE International Conference on Data Mining Workshop Pub Date : 2014-12-01 DOI: 10.1109/ICDMW.2014.9
Xiaofei Zhou, Li Guo, Ping Liu, Yanbing Liu
{"title":"Latent Factor SVM for Text Categorization","authors":"Xiaofei Zhou, Li Guo, Ping Liu, Yanbing Liu","doi":"10.1109/ICDMW.2014.9","DOIUrl":"https://doi.org/10.1109/ICDMW.2014.9","url":null,"abstract":"Text categorization is an important research in nature language process and content analysis. In this paper, we present latent factor SVM (LF-SVM) for text categorization which use latent factor vectors for category representation on text categorization. We prove that latent factors extracted by PLSA (probability latent semantic analysis) can span convex structure to express text category. Based on the category expression we adopt maximal margin hyper plane to divide the categories. The experiments on normal text datasets show that our motivation and algorithm are reasonable and effective.","PeriodicalId":289269,"journal":{"name":"2014 IEEE International Conference on Data Mining Workshop","volume":"201 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125628035","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
Minimum Information Loss Based Multi-kernel Learning for Flagellar Protein Recognition in Trypanosoma Brucei 基于最小信息损失的多核学习布鲁氏锥虫鞭毛蛋白识别
2014 IEEE International Conference on Data Mining Workshop Pub Date : 2014-12-01 DOI: 10.1109/ICDMW.2014.142
Jim Jing-Yan Wang, Xin Gao
{"title":"Minimum Information Loss Based Multi-kernel Learning for Flagellar Protein Recognition in Trypanosoma Brucei","authors":"Jim Jing-Yan Wang, Xin Gao","doi":"10.1109/ICDMW.2014.142","DOIUrl":"https://doi.org/10.1109/ICDMW.2014.142","url":null,"abstract":"Trypanosma brucei (T. Brucei) is an important pathogen agent of African trypanosomiasis. The flagellum is an essential and multifunctional organelle of T. Brucei, thus it is very important to recognize the flagellar proteins from T. Brucei proteins for the purposes of both biological research and drug design. In this paper, we investigate computationally recognizing flagellar proteins in T. Brucei by pattern recognition methods. It is argued that an optimal decision function can be obtained as the difference of probability functions of flagella protein and the non-flagellar protein for the purpose of flagella protein recognition. We propose to learn a multi-kernel classification function to approximate this optimal decision function, by minimizing the information loss of such approximation which is measured by the Kull back - Leibler (KL) divergence. An iterative multi-kernel classifier learning algorithm is developed to minimize the KL divergence for the problem of T. Brucei flagella protein recognition, experiments show its advantage over other T. Brucei flagellar protein recognition and multi-kernel learning methods.","PeriodicalId":289269,"journal":{"name":"2014 IEEE International Conference on Data Mining Workshop","volume":"104 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121959940","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
Clustering and Classification of Like-Minded People from their Tweets 从他们的推文中聚类和分类志同道合的人
2014 IEEE International Conference on Data Mining Workshop Pub Date : 2014-12-01 DOI: 10.1109/ICDMW.2014.161
S. Jaffali, Salma Jamoussi, A. B. Hamadou, K. Smaïli
{"title":"Clustering and Classification of Like-Minded People from their Tweets","authors":"S. Jaffali, Salma Jamoussi, A. B. Hamadou, K. Smaïli","doi":"10.1109/ICDMW.2014.161","DOIUrl":"https://doi.org/10.1109/ICDMW.2014.161","url":null,"abstract":"Several challenges accompanied the growth of online social networks, such as grouping people with similar interest. Grouping like-minded people is of a high importance. Indeed, it leads to many applications like link prediction and friend or product suggestion, and explains various social phenomenon. In this paper, we present two methods of grouping like-minded people based on their textual posts. Compared to three baseline methods K-Means, LDA and the Scalable Multistage Clustering algorithm (SMSC), our algorithms achieves relative improvements on two corpora of tweets.","PeriodicalId":289269,"journal":{"name":"2014 IEEE International Conference on Data Mining Workshop","volume":"84 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133357189","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
Segmentation and Splitting of Touching Vaginal Bacteria Based on Superpixel and Effective Distance 基于超像素和有效距离的触摸阴道细菌分割与分裂
2014 IEEE International Conference on Data Mining Workshop Pub Date : 2014-12-01 DOI: 10.1109/ICDMW.2014.172
Youyi Song, Dong Ni, Liang He, Siping Chen, B. Lei, Tianfu Wang
{"title":"Segmentation and Splitting of Touching Vaginal Bacteria Based on Superpixel and Effective Distance","authors":"Youyi Song, Dong Ni, Liang He, Siping Chen, B. Lei, Tianfu Wang","doi":"10.1109/ICDMW.2014.172","DOIUrl":"https://doi.org/10.1109/ICDMW.2014.172","url":null,"abstract":"In this paper, a new method for segmentation and splitting of touching vaginal bacteria based on super pixel method is proposed. Feature fusion is integrated with kernel-based support vector machine (SVM) for bacteria segmentation. After segmentation by super pixel, the touching bacteria regions are further separated according to the defined effective distance. Finally, the separated bacteria are counted finally for the performance evaluation. Our experimental results show that the proposed method has achieved promising segmentation result. Moreover, compared to the state-of-the-arts method, better segmentation results have also been achieved.","PeriodicalId":289269,"journal":{"name":"2014 IEEE International Conference on Data Mining Workshop","volume":"47 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114851808","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
A New Fast Minimum Spanning Tree-Based Clustering Technique 一种新的快速最小生成树聚类技术
2014 IEEE International Conference on Data Mining Workshop Pub Date : 2014-12-01 DOI: 10.1109/ICDMW.2014.139
Xiaochun Wang, X. Wang, Jihua Zhu
{"title":"A New Fast Minimum Spanning Tree-Based Clustering Technique","authors":"Xiaochun Wang, X. Wang, Jihua Zhu","doi":"10.1109/ICDMW.2014.139","DOIUrl":"https://doi.org/10.1109/ICDMW.2014.139","url":null,"abstract":"Due to its important applications in data mining, many techniques have been developed for clustering. For today's real-world databases which typically have millions of items with many thousands of fields, resulting in datasets that range in size into terabytes, many traditional clustering techniques have more and more restricted capabilities and novel approaches that are computationally efficient have become more and more popular. In this paper, a new efficient approach to graph-theoretical clustering using a minimum spanning tree representation of a dataset is proposed which consists of two-phases. In the first phase, we modify the standard Prim's algorithm in such a way that an efficient construction of such a tree can be realized based on k-nearest neighbor search mechanisms, during which a new edge weight is defined to maximize the intra-cluster similarity and minimize the inter-cluster similarity of the data set. In the second phase, based on the intuition that the data points are closer in the same cluster than in different clusters, the longest edges in the minimum spanning tree obtained from the first phase are removed to form clusters as the standard minimum spanning tree-based clustering algorithms do. Experiments on synthetic as well as real data sets have been conducted to show that our proposed approach works well with respect to the state-of-the-art methods.","PeriodicalId":289269,"journal":{"name":"2014 IEEE International Conference on Data Mining Workshop","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115066230","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
Semi-Supervised Method for Multi-category Emotion Recognition in Tweets 推文多类别情感识别的半监督方法
2014 IEEE International Conference on Data Mining Workshop Pub Date : 2014-12-01 DOI: 10.1109/ICDMW.2014.146
Valentina Sintsova, C. Musat, P. Pu
{"title":"Semi-Supervised Method for Multi-category Emotion Recognition in Tweets","authors":"Valentina Sintsova, C. Musat, P. Pu","doi":"10.1109/ICDMW.2014.146","DOIUrl":"https://doi.org/10.1109/ICDMW.2014.146","url":null,"abstract":"Each tweet is limited to 140 characters. This constraint surprisingly makes Twitter a more spontaneous platform to express our emotions. Detecting emotions and correctly classifying them automatically is an increasingly important task if we want to understand how large groups of people feel about an event or relevant topic. However, constructing supervised classifiers can be a daunting task because of the high manual annotation costs. We propose constructing emotion classifiers with a minimal amount of initial knowledge (e.g. A general-purpose emotion lexicon) and using a semi-supervised learning method to extend it to correctly detect more emotional tweets within a specific domain. Additionally, we show that our algorithm, Balanced Weighted Voting (or BWV) is able to overcome the imbalanced distribution of emotions in the initial labeled data. Our validation experiments show that BWV improves the performance of three initial classifiers, at least in the specific domain of sports. Furthermore, its comparison with other two learning strategies reveals its superiority in terms of macro F1-score, as well as more stable performance among different emotion categories.","PeriodicalId":289269,"journal":{"name":"2014 IEEE International Conference on Data Mining Workshop","volume":"334 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116462553","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}
引用次数: 9
NaviSoc: A Socially Enhanced Real-Time Navigator NaviSoc:社交增强的实时导航器
2014 IEEE International Conference on Data Mining Workshop Pub Date : 2014-12-01 DOI: 10.1109/ICDMW.2014.77
Nikolaos Louloudakis, Vasileios Theodosiadis, H. Kondylakis, K. Stefanidis
{"title":"NaviSoc: A Socially Enhanced Real-Time Navigator","authors":"Nikolaos Louloudakis, Vasileios Theodosiadis, H. Kondylakis, K. Stefanidis","doi":"10.1109/ICDMW.2014.77","DOIUrl":"https://doi.org/10.1109/ICDMW.2014.77","url":null,"abstract":"As the usage of social networks becomes more and more ubiquitous and people commute more often today, social streams have become a valuable source for many kinds of applications. For example, the various social streams could be exploited for choosing the optimal path (e.g., The shortest and/or the fastest) to reach a desired destination. To this direction, we present a novel navigation system, called NaviSoc. NaviSoc is a location-based, context-aware recommendation system proposing dynamically and in real-time, the best route according to the user's context (e.g., Preferences and budget). The system takes advantage of social streams in order to identify unprecedented (e.g., Traffic jam, protest) or social events occurring in a specific place. Then, using this knowledge, the system dynamically readjusts the proposed navigation path. An initial evaluation, performed on the Greek island of Crete, demonstrates the feasibility of our solution and the benefits of our system.","PeriodicalId":289269,"journal":{"name":"2014 IEEE International Conference on Data Mining Workshop","volume":"71 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122015882","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
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学术官方微信