2012 IEEE 12th International Conference on Data Mining最新文献

筛选
英文 中文
Metric Learning from Relative Comparisons by Minimizing Squared Residual 基于残差平方最小化的相对比较的度量学习
2012 IEEE 12th International Conference on Data Mining Pub Date : 2012-12-10 DOI: 10.1109/ICDM.2012.38
E. Y. Liu, Zhishan Guo, Xiang Zhang, V. Jojic, Wei Wang
{"title":"Metric Learning from Relative Comparisons by Minimizing Squared Residual","authors":"E. Y. Liu, Zhishan Guo, Xiang Zhang, V. Jojic, Wei Wang","doi":"10.1109/ICDM.2012.38","DOIUrl":"https://doi.org/10.1109/ICDM.2012.38","url":null,"abstract":"Recent studies [1] -- [5] have suggested using constraints in the form of relative distance comparisons to represent domain knowledge: d(a, b) <; d(c, d) where d(·) is the distance function and a, b, c, d are data objects. Such constraints are readily available in many problems where pairwise constraints are not natural to obtain. In this paper we consider the problem of learning a Mahalanobis distance metric from supervision in the form of relative distance comparisons. We propose a simple, yet effective, algorithm that minimizes a convex objective function corresponding to the sum of squared residuals of constraints. We also extend our model and algorithm to promote sparsity in the learned metric matrix. Experimental results suggest that our method consistently outperforms existing methods in terms of clustering accuracy. Furthermore, the sparsity extension leads to more stable estimation when the dimension is high and only a small amount of supervision is given.","PeriodicalId":255609,"journal":{"name":"2012 IEEE 12th International Conference on Data Mining","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-12-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124406216","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}
引用次数: 56
Heterogeneous Constraint Propagation with Constrained Sparse Representation 基于约束稀疏表示的异构约束传播
2012 IEEE 12th International Conference on Data Mining Pub Date : 2012-12-10 DOI: 10.1109/ICDM.2012.13
Zhiwu Lu, Yuxin Peng
{"title":"Heterogeneous Constraint Propagation with Constrained Sparse Representation","authors":"Zhiwu Lu, Yuxin Peng","doi":"10.1109/ICDM.2012.13","DOIUrl":"https://doi.org/10.1109/ICDM.2012.13","url":null,"abstract":"This paper presents a graph-based method for heterogeneous constraint propagation on multi-modal data using constrained sparse representation. Since heterogeneous pair wise constraints are defined over pairs of data points from different modalities, heterogeneous constraint propagation is more challenging than the transitional homogeneous constraint propagation on single-modal data which has been studied extensively in previous work. The main difficulty of heterogeneous constraint propagation lies in how to effectively propagate heterogeneous pair wise constraints across different modalities. To address this issue, we decompose heterogeneous constraint propagation into semi-supervised learning sub problems which can then be efficiently solved by graph-based label propagation. Moreover, we develop a constrained sparse representation method for graph construction over each modality using homogeneous pair wise constraints. The experimental results in cross-modal retrieval have shown the superior performance of our heterogeneous constraint propagation.","PeriodicalId":255609,"journal":{"name":"2012 IEEE 12th International Conference on Data Mining","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-12-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127208057","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
Simultaneously Combining Multi-view Multi-label Learning with Maximum Margin Classification 同时结合多视图多标签学习和最大边际分类
2012 IEEE 12th International Conference on Data Mining Pub Date : 2012-12-10 DOI: 10.1109/ICDM.2012.88
Zheng Fang, Zhongfei Zhang
{"title":"Simultaneously Combining Multi-view Multi-label Learning with Maximum Margin Classification","authors":"Zheng Fang, Zhongfei Zhang","doi":"10.1109/ICDM.2012.88","DOIUrl":"https://doi.org/10.1109/ICDM.2012.88","url":null,"abstract":"Multiple feature views arise in various important data classification scenarios. However, finding a consensus feature view from multiple feature views for a classifier is still a challenging task. We present a new classification framework using the multi-label correlation information to address the problem of simultaneously combining multiple feature views and maximum margin classification. Under this framework, we propose a novel algorithm that iteratively computes the multiple view feature mapping matrices, the consensus feature view representation, and the coefficients of the classifier. Extensive experimental evaluations demonstrate the effectiveness and promise of this framework as well as the algorithm for discovering a consensus view from multiple feature views.","PeriodicalId":255609,"journal":{"name":"2012 IEEE 12th International Conference on Data Mining","volume":"88 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-12-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117312234","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}
引用次数: 26
Bounded Matrix Low Rank Approximation 有界矩阵低秩近似
2012 IEEE 12th International Conference on Data Mining Pub Date : 2012-12-10 DOI: 10.1109/ICDM.2012.131
R. Kannan, Mariya Ishteva, Haesun Park
{"title":"Bounded Matrix Low Rank Approximation","authors":"R. Kannan, Mariya Ishteva, Haesun Park","doi":"10.1109/ICDM.2012.131","DOIUrl":"https://doi.org/10.1109/ICDM.2012.131","url":null,"abstract":"Matrix lower rank approximations such as non-negative matrix factorization (NMF) have been successfully used to solve many data mining tasks. In this paper, we propose a new matrix lower rank approximation called Bounded Matrix Low Rank Approximation (BMA) which imposes a lower and an upper bound on every element of a lower rank matrix that best approximates a given matrix with missing elements. This new approximation models many real world problems, such as recommender systems, and performs better than other methods, such as singular value decompositions (SVD) or NMF. We present an efficient algorithm to solve BMA based on coordinate descent method. BMA is different from NMF as it imposes bounds on the approximation itself rather than on each of the low rank factors. We show that our algorithm is scalable for large matrices with missing elements on multi core systems with low memory. We present substantial experimental results illustrating that the proposed method outperforms the state of the art algorithms for recommender systems such as Stochastic Gradient Descent, Alternating Least Squares with regularization, SVD++, Bias-SVD on real world data sets such as Jester, Movie lens, Book crossing, Online dating and Netflix.","PeriodicalId":255609,"journal":{"name":"2012 IEEE 12th International Conference on Data Mining","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-12-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123961917","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}
引用次数: 26
Efficient Episode Mining of Dynamic Event Streams 动态事件流的高效集挖掘
2012 IEEE 12th International Conference on Data Mining Pub Date : 2012-12-10 DOI: 10.1109/ICDM.2012.84
D. Patnaik, S. Laxman, B. Chandramouli, Naren Ramakrishnan
{"title":"Efficient Episode Mining of Dynamic Event Streams","authors":"D. Patnaik, S. Laxman, B. Chandramouli, Naren Ramakrishnan","doi":"10.1109/ICDM.2012.84","DOIUrl":"https://doi.org/10.1109/ICDM.2012.84","url":null,"abstract":"Discovering frequent episodes over event sequences is an important data mining problem. Existing methods typically require multiple passes over the data, rendering them unsuitable for streaming contexts. We present the first streaming algorithm for mining frequent episodes over a window of recent events in the stream. We derive approximation guarantees for our algorithm in terms of: (i) the separation of frequent episodes from infrequent ones, and (ii) the rate of change of stream characteristics. Our parameterization of the problem provides a new sweet spot in the tradeoff between making distributional assumptions over the stream and algorithmic efficiencies of mining. We illustrate how this yields significant benefits when mining practical streams from neuroscience and telecommunications logs.","PeriodicalId":255609,"journal":{"name":"2012 IEEE 12th International Conference on Data Mining","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-12-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121285625","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}
引用次数: 26
Healing Truncation Bias: Self-Weighted Truncation Framework for Dual Averaging 修复截断偏差:双重平均的自加权截断框架
2012 IEEE 12th International Conference on Data Mining Pub Date : 2012-12-10 DOI: 10.1109/ICDM.2012.33
H. Oiwa, Shin Matsushima, Hiroshi Nakagawa
{"title":"Healing Truncation Bias: Self-Weighted Truncation Framework for Dual Averaging","authors":"H. Oiwa, Shin Matsushima, Hiroshi Nakagawa","doi":"10.1109/ICDM.2012.33","DOIUrl":"https://doi.org/10.1109/ICDM.2012.33","url":null,"abstract":"We propose a new truncation framework for online supervised learning. Learning a compact predictive model in an online setting has recently attracted a great deal of attention. The combination of online learning with sparsity-inducing regularization enables faster learning with a smaller memory space than a conventional learning framework. However, a simple combination of these triggers the truncation of weights whose corresponding features rarely appear, even if these features are crucial for prediction. Furthermore, it is difficult to emphasize these features in advance while preserving the advantages of online learning. We develop an extensional truncation framework to Dual Averaging, which retains rarely occurring but informative features. Our proposed framework integrates information on all previous sub gradients of the loss functions into a regularization term. Our enhancement of a conventional L1-regularization accomplishes the automatic adjustment of each feature's truncations. This extension enables us to identify and retain rare but informative features without preprocessing. In addition, our framework achieves the same computational complexity and regret bound as standard Dual Averaging. Experiments demonstrated that our framework outperforms other sparse online learning algorithms.","PeriodicalId":255609,"journal":{"name":"2012 IEEE 12th International Conference on Data Mining","volume":"39 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-12-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114698230","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
Kernel-Based Weighted Multi-view Clustering 基于核的加权多视图聚类
2012 IEEE 12th International Conference on Data Mining Pub Date : 2012-12-10 DOI: 10.1109/ICDM.2012.43
Grigorios Tzortzis, A. Likas
{"title":"Kernel-Based Weighted Multi-view Clustering","authors":"Grigorios Tzortzis, A. Likas","doi":"10.1109/ICDM.2012.43","DOIUrl":"https://doi.org/10.1109/ICDM.2012.43","url":null,"abstract":"Exploiting multiple representations, or views, for the same set of instances within a clustering framework is a popular practice for boosting clustering accuracy. However, some of the available sources may be misleading (due to noise, errors in measurement etc.) in revealing the true structure of the data, thus, their inclusion in the clustering process may have negative influence. This aspect seems to be overlooked in the multi-view literature where all representations are equally considered. In this work, views are expressed in terms of given kernel matrices and a weighted combination of the kernels is learned in parallel to the partitioning. Weights assigned to kernels are indicative of the quality of the corresponding views' information. Additionally, the combination scheme incorporates a parameter that controls the admissible sparsity of the weights to avoid extremes and tailor them to the data. Two efficient iterative algorithms are proposed that alternate between updating the view weights and recomputing the clusters to optimize the intra-cluster variance from different perspectives. The conducted experiments reveal the effectiveness of our methodology compared to other multi-view methods.","PeriodicalId":255609,"journal":{"name":"2012 IEEE 12th International Conference on Data Mining","volume":"64 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-12-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114878951","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}
引用次数: 214
Exclusive Row Biclustering for Gene Expression Using a Combinatorial Auction Approach 基于组合拍卖方法的基因表达独占行双聚类
2012 IEEE 12th International Conference on Data Mining Pub Date : 2012-12-10 DOI: 10.1109/ICDM.2012.25
Amichai Painsky, Saharon Rosset
{"title":"Exclusive Row Biclustering for Gene Expression Using a Combinatorial Auction Approach","authors":"Amichai Painsky, Saharon Rosset","doi":"10.1109/ICDM.2012.25","DOIUrl":"https://doi.org/10.1109/ICDM.2012.25","url":null,"abstract":"The availability of large microarray data has led to a growing interest in biclustering methods in the past decade. Several algorithms have been proposed to identify subsets of genes and conditions according to different similarity measures and under varying constraints. In this paper we focus on the exclusive row biclusteing problem (also known as projected clustering) for gene expression data sets, in which each row can only be a member of a single bicluster while columns can participate in multiple clusters. This type of biclustering may be adequate, for example, for clustering groups of cancer patients where each patient (row) is expected to be carrying only a single type of cancer, while each cancer type is associated with multiple (and possibly overlapping) genes (columns). In this paper we present a novel method to identify these exclusive row biclusters through a combination of existing biclustering algorithms and combinatorial auction techniques. We devise an approach for tuning the threshold for our algorithm based on comparison to a null model in the spirit of the Gap statistic approach. We demonstrate our approach on both synthetic and real-world gene expression data and show its power in identifying large span non-overlapping rows sub matrices, while considering their unique nature. The Gap statistic approach succeeds in identifying appropriate thresholds in all our examples.","PeriodicalId":255609,"journal":{"name":"2012 IEEE 12th International Conference on Data Mining","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-12-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126389187","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
Outlier Detection in Arbitrarily Oriented Subspaces 任意方向子空间中的离群点检测
2012 IEEE 12th International Conference on Data Mining Pub Date : 2012-12-10 DOI: 10.1109/ICDM.2012.21
H. Kriegel, Peer Kröger, Erich Schubert, A. Zimek
{"title":"Outlier Detection in Arbitrarily Oriented Subspaces","authors":"H. Kriegel, Peer Kröger, Erich Schubert, A. Zimek","doi":"10.1109/ICDM.2012.21","DOIUrl":"https://doi.org/10.1109/ICDM.2012.21","url":null,"abstract":"In this paper, we propose a novel outlier detection model to find outliers that deviate from the generating mechanisms of normal instances by considering combinations of different subsets of attributes, as they occur when there are local correlations in the data set. Our model enables to search for outliers in arbitrarily oriented subspaces of the original feature space. We show how in addition to an outlier score, our model also derives an explanation of the outlierness that is useful in investigating the results. Our experiments suggest that our novel method can find different outliers than existing work and can be seen as a complement of those approaches.","PeriodicalId":255609,"journal":{"name":"2012 IEEE 12th International Conference on Data Mining","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-12-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115202876","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}
引用次数: 118
Efficient Algorithms for Finding Richer Subgroup Descriptions in Numeric and Nominal Data 在数值和标称数据中寻找更丰富子群描述的有效算法
2012 IEEE 12th International Conference on Data Mining Pub Date : 2012-12-10 DOI: 10.1109/ICDM.2012.117
M. Mampaey, Siegfried Nijssen, A. Feelders, A. Knobbe
{"title":"Efficient Algorithms for Finding Richer Subgroup Descriptions in Numeric and Nominal Data","authors":"M. Mampaey, Siegfried Nijssen, A. Feelders, A. Knobbe","doi":"10.1109/ICDM.2012.117","DOIUrl":"https://doi.org/10.1109/ICDM.2012.117","url":null,"abstract":"Subgroup discovery systems are concerned with finding interesting patterns in labeled data. How these systems deal with numeric and nominal data has a large impact on the quality of their results. In this paper, we consider two ways to extend the standard pattern language of subgroup discovery: using conditions that test for interval membership for numeric attributes, and value set membership for nominal attributes. We assume a greedy search setting, that is, iteratively refining a given subgroup, with respect to a (convex) quality measure. For numeric attributes, we propose an algorithm that finds the optimal interval in linear (rather than quadratic) time, with respect to the number of examples and split points. Similarly, for nominal attributes, we show that finding the optimal set of values can be achieved in linear (rather than exponential) time, with respect to the number of examples and the size of the domain of the attribute. These algorithms operate by only considering subgroup refinements that lie on a convex hull in ROC space, thus significantly narrowing down the search space. We further provide efficient algorithms specifically for the popular Weighted Relative Accuracy quality measure, taking advantage of some of its properties. Our algorithms are shown to perform well in practice, and furthermore provide additional expressive power leading to higher-quality results.","PeriodicalId":255609,"journal":{"name":"2012 IEEE 12th International Conference on Data Mining","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-12-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115450938","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
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学术官方微信
小红书