2014 IEEE Symposium on Computational Intelligence and Data Mining (CIDM)最新文献

筛选
英文 中文
Sensor dynamics in high dimensional phase spaces via nonlinear transformations: Application to helicopter loads monitoring 基于非线性变换的高维相空间传感器动力学:在直升机载荷监测中的应用
2014 IEEE Symposium on Computational Intelligence and Data Mining (CIDM) Pub Date : 2014-12-01 DOI: 10.1109/CIDM.2014.7008691
J. J. Valdés, C. Cheung, Matthew Li
{"title":"Sensor dynamics in high dimensional phase spaces via nonlinear transformations: Application to helicopter loads monitoring","authors":"J. J. Valdés, C. Cheung, Matthew Li","doi":"10.1109/CIDM.2014.7008691","DOIUrl":"https://doi.org/10.1109/CIDM.2014.7008691","url":null,"abstract":"Accurately determining component loads on a helicopter is an important goal in the helicopter structural integrity field, with repercussions on safety, component damage, maintenance schedules and other operations. Measuring dynamic component loads directly is possible, but these measurement methods are costly and are difficult to maintain. While the ultimate goal is to estimate the loads from flight state and control system parameters available in most helicopters, a necessary step is understanding the behavior of the loads under different flight conditions. This paper explores the behavior of the main rotor normal bending loads in level flight, steady turn and rolling pullout flight conditions, as well as the potential of computational intelligence methods in understanding the dynamics. Time delay methods, residual variance analysis (gamma test) using genetic algorithms, unsupervised non-linear mapping and recurrence plot and quantification analysis were used. The results from this initial work demonstrate that there are important differences in the load behavior of the main rotor blade under the different flight conditions which must be taken into account when working with machine learning methods for developing prediction models.","PeriodicalId":117542,"journal":{"name":"2014 IEEE Symposium on Computational Intelligence and Data Mining (CIDM)","volume":"1 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":"129182314","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
Batch linear least squares-based learning algorithm for MLMVN with soft margins 基于批处理线性最小二乘的软边MLMVN学习算法
2014 IEEE Symposium on Computational Intelligence and Data Mining (CIDM) Pub Date : 2014-12-01 DOI: 10.1109/CIDM.2014.7008147
E. Aizenberg, I. Aizenberg
{"title":"Batch linear least squares-based learning algorithm for MLMVN with soft margins","authors":"E. Aizenberg, I. Aizenberg","doi":"10.1109/CIDM.2014.7008147","DOIUrl":"https://doi.org/10.1109/CIDM.2014.7008147","url":null,"abstract":"In this paper, we consider a batch learning algorithm for the multilayer neural network with multi-valued neurons (MLMVN) and its soft margins variant (MLMVN-SM). MLMVN is a neural network with a standard feedforward organization based on the multi-valued neuron (MVN). MVN is a neuron with complex-valued weights and inputs/output located on the unit circle. Standard MLMVN has a derivative-free learning algorithm based on the error-correction learning rule. Recently, this algorithm was modified for MLMVN with discrete outputs by using soft margins (MLMVN-SM). This modification improves classification results when MLMVN is used as a classifier. Another recent development in MLMVN is the use of batch acceleration step for MLMVN with a single output neuron. Complex QR-decomposition was used to adjust the output neuron weights for all learning samples simultaneously, while the hidden neuron weights were adjusted in a regular way. In this paper, we merge the soft margins approach with batch learning. We suggest a batch linear least squares (LLS) learning algorithm for MLMVN-SM. We also expand the batch technique to multiple output neurons and hidden neurons. This new learning technique drastically reduces the number of learning iterations and learning time when solving classification problems (compared to MLMVN-SM), while maintaining the classification accuracy of MLMVN-SM.","PeriodicalId":117542,"journal":{"name":"2014 IEEE Symposium on Computational Intelligence and Data Mining (CIDM)","volume":"64 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":"126834243","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}
引用次数: 10
Experimental studies on indoor sign recognition and classification 室内标识识别与分类的实验研究
2014 IEEE Symposium on Computational Intelligence and Data Mining (CIDM) Pub Date : 2014-12-01 DOI: 10.1109/CIDM.2014.7008707
Zhen Ni, Si-Yao Fu, Bo Tang, Haibo He, Xinming Huang
{"title":"Experimental studies on indoor sign recognition and classification","authors":"Zhen Ni, Si-Yao Fu, Bo Tang, Haibo He, Xinming Huang","doi":"10.1109/CIDM.2014.7008707","DOIUrl":"https://doi.org/10.1109/CIDM.2014.7008707","url":null,"abstract":"Previous works on outdoor traffic sign recognition and classification have been demonstrated useful to the driver assistant system and the possibility to the autonomous vehicles. This motivates our research on the assistance for visual impairment or visual disabled pedestrians in the indoor environment. In this paper, we build an indoor sign database and investigate the recognition and classification for the indoor sign problem. We adopt the classical techniques on extracting the features, including the principle component analysis (PCA), dense scale invariant feature transform (DSIFT), histogram of oriented gradients (HOG), and conduct the state-of-art classification techniques, such as the neural network (NN), support vector machine (SVM) and k-nearest neighbors (KNN). We provide the experimental results on this newly built database and also discuss the insight for the possibility of indoor navigation for the blind or visual-disabled people.","PeriodicalId":117542,"journal":{"name":"2014 IEEE Symposium on Computational Intelligence and Data Mining (CIDM)","volume":"9 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":"122366921","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
Convex multi-task relationship learning using hinge loss 基于铰链损失的凸多任务关系学习
2014 IEEE Symposium on Computational Intelligence and Data Mining (CIDM) Pub Date : 2014-12-01 DOI: 10.1109/CIDM.2014.7008149
Anveshi Charuvaka, H. Rangwala
{"title":"Convex multi-task relationship learning using hinge loss","authors":"Anveshi Charuvaka, H. Rangwala","doi":"10.1109/CIDM.2014.7008149","DOIUrl":"https://doi.org/10.1109/CIDM.2014.7008149","url":null,"abstract":"Multi-task learning improves generalization performance by learning several related tasks jointly. Several methods have been proposed for multi-task learning in recent years. Many methods make strong assumptions about symmetric task relationships while some are able to utilize externally provided task relationships. However, in many real world tasks the degree of relatedness among tasks is not known a priori. Methods which are able to extract the task relationships and exploit them while simultaneously learning models with good generalization performance can address this limitation. In the current work, we have extended a recently proposed method for learning task relationships using smooth squared loss for regression to classification problems using non-smooth hinge loss due to the demonstrated effectiveness of SVM classifier in single task classification settings. We have also developed an efficient optimization procedure using bundle methods for the proposed multi-task learning formulation. We have validated our method on one simulated and two real world datasets and have compared its performance to competitive baseline single-task and multi-task methods.","PeriodicalId":117542,"journal":{"name":"2014 IEEE Symposium on Computational Intelligence and Data Mining (CIDM)","volume":"30 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":"114803510","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
Automatic text categorization using a system of high-precision and high-recall models 使用高精度和高召回模型的自动文本分类系统
2014 IEEE Symposium on Computational Intelligence and Data Mining (CIDM) Pub Date : 2014-12-01 DOI: 10.1109/CIDM.2014.7008692
Dai Li, Y. Murphey
{"title":"Automatic text categorization using a system of high-precision and high-recall models","authors":"Dai Li, Y. Murphey","doi":"10.1109/CIDM.2014.7008692","DOIUrl":"https://doi.org/10.1109/CIDM.2014.7008692","url":null,"abstract":"This paper presents an automatic text document categorization system, HPHR. HPHR contains high precision, high recall and noise-filtered text categorization models. The text categorization models are generated through a suite of machine learning algorithms, a fast clustering algorithm that efficiently and effectively group documents into subcategories, and a text category generation algorithm that automatically generates text subcategories that represent high precision, high recall and noise-filtered text categorization models from a given set of training documents. The HPHR system was evaluated on documents drawn from two different applications, vehicle fault diagnostic documents, which are in a form of unstructured and verbatim text descriptions, and Reuters corpus. The performance of the proposed system, HPHR, on both document collections showed superiority over the systems commonly used in text document categorization.","PeriodicalId":117542,"journal":{"name":"2014 IEEE Symposium on Computational Intelligence and Data Mining (CIDM)","volume":"37 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":"129576760","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
Using data mining to investigate interaction between channel characteristics and hydraulic geometry channel types 利用数据挖掘技术研究河道特征与水工几何河道类型之间的相互作用
2014 IEEE Symposium on Computational Intelligence and Data Mining (CIDM) Pub Date : 2014-12-01 DOI: 10.1109/CIDM.2014.7008706
Leong Lee, Gregory S. Ridenour
{"title":"Using data mining to investigate interaction between channel characteristics and hydraulic geometry channel types","authors":"Leong Lee, Gregory S. Ridenour","doi":"10.1109/CIDM.2014.7008706","DOIUrl":"https://doi.org/10.1109/CIDM.2014.7008706","url":null,"abstract":"Data was mined for the purpose of extracting data from an online source to compute and classify hydraulic geometry as well as providing additional data (channel stability, material, and evenness) for pattern discovery. Hydraulic geometry, the relationships between a stream's geometry (width and depth) and flow (velocity and discharge), is applicable to flood prediction, water resources management, and modeling point sources of pollution. Although data to compute hydraulic geometry and additional channel data are freely available online, a systematic data mining approach is seldom if ever used for classification of hydraulic geometry and discernment of regional trends encompassing multi-state areas. In this paper, a method for computing and classifying hydraulic geometry from mined channel flow and geometry data from several states was introduced. Additional channel characteristics (stability, evenness, and material) were also mined. Channels were mapped by stability and a scatterplot matrix revealed no anomalies in the hydraulic geometry of individual channel sections. To assess the quality of data output, statistical analyses were conducted to show that our mined data were comparable to data from the literature as indicated by Euclidean distances between multivariate means, histograms of frequency distributions of hydraulic exponents, and Spearman's rank order correlation applied to channel types. Channels exhibited significant interaction between stability and material, between stability and evenness, but not between material and evenness. Boundary lines through the classification diagram were effective in discriminating stability and material but not evenness.","PeriodicalId":117542,"journal":{"name":"2014 IEEE Symposium on Computational Intelligence and Data Mining (CIDM)","volume":"35 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":"131835632","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
A density-based clustering of the Self-Organizing Map using graph cut 一种基于密度的自组织映射聚类方法
2014 IEEE Symposium on Computational Intelligence and Data Mining (CIDM) Pub Date : 2014-12-01 DOI: 10.1109/CIDM.2014.7008145
Leonardo Enzo Brito da Silva, J. A. F. Costa
{"title":"A density-based clustering of the Self-Organizing Map using graph cut","authors":"Leonardo Enzo Brito da Silva, J. A. F. Costa","doi":"10.1109/CIDM.2014.7008145","DOIUrl":"https://doi.org/10.1109/CIDM.2014.7008145","url":null,"abstract":"In this paper, an algorithm to automatically cluster the Self-Organizing Map (SOM) is presented. The proposed approach consists of creating a graph based on the SOM grid, whose connection strengths are measured in terms of pattern density. The connection of this graph are filtered in order to remove the mutually weakest connections between two adjacent neurons. The remaining graph is then pruned after transposing its connections to a second slightly larger graph by using a blind search algorithm that aims to grow the seed of the cluster's boundaries until they reach the outermost nodes of the latter graph. Values for the threshold regarding the minimum size of the seeds are scanned and possible solutions are determined. Finally, a figure of merit that evaluates both the connectedness and separation selects the optimal partition. Experimental results are depicted using synthetic and real world datasets.","PeriodicalId":117542,"journal":{"name":"2014 IEEE Symposium on Computational Intelligence and Data Mining (CIDM)","volume":"15 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":"121317182","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
MapReduce guided approximate inference over graphical models MapReduce在图形模型上引导近似推理
2014 IEEE Symposium on Computational Intelligence and Data Mining (CIDM) Pub Date : 2014-12-01 DOI: 10.1109/CIDM.2014.7008702
Ahsanul Haque, Swarup Chandra, L. Khan, M. Baron
{"title":"MapReduce guided approximate inference over graphical models","authors":"Ahsanul Haque, Swarup Chandra, L. Khan, M. Baron","doi":"10.1109/CIDM.2014.7008702","DOIUrl":"https://doi.org/10.1109/CIDM.2014.7008702","url":null,"abstract":"A graphical model represents the data distribution of a data generating process and inherently captures its feature relationships. This stochastic model can be used to perform inference, to calculate posterior probabilities, in various applications such as classification. Exact inference algorithms are known to be intractable on large networks due to exponential time and space complexity. Approximate inference algorithms are instead widely used in practice to overcome this constraint, with a trade off in accuracy. Stochastic sampling is one such method where an approximate probability distribution is empirically evaluated using various sampling techniques. However, these algorithms may still suffer from scalability issues on large and complex networks. To address this challenge, we have designed and implemented several MapReduce based distributed versions of a specific type of approximate inference algorithm called Adaptive Importance Sampling (AIS). We compare and evaluate the proposed approaches using benchmark networks. Experimental result shows that our approach achieves significant scaleup and speedup compared to the sequential algorithm, while achieving similar accuracy asymptotically.","PeriodicalId":117542,"journal":{"name":"2014 IEEE Symposium on Computational Intelligence and Data Mining (CIDM)","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":"126985769","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 novel criterion for overlapping communities detection and clustering improvement 一种新的重叠群落检测和聚类改进准则
2014 IEEE Symposium on Computational Intelligence and Data Mining (CIDM) Pub Date : 2014-12-01 DOI: 10.1109/CIDM.2014.7008675
A. Berti, A. Sperduti, Andrea Burattin
{"title":"A novel criterion for overlapping communities detection and clustering improvement","authors":"A. Berti, A. Sperduti, Andrea Burattin","doi":"10.1109/CIDM.2014.7008675","DOIUrl":"https://doi.org/10.1109/CIDM.2014.7008675","url":null,"abstract":"In community detection, the theme of correctly identifying overlapping nodes, i.e. nodes which belong to more than one community, is important as it is related to role detection and to the improvement of the quality of clustering: proper detection of overlapping nodes gives a better understanding of the community structure. In this paper, we introduce a novel measure, called cuttability, that we show being useful for reliable detection of overlaps among communities and for improving the quality of the clustering, measured via modularity. The proposed algorithm shows better behaviour than existing techniques on the considered datasets (IRC logs and Enron e-mail log). The best behaviour is caught when a network is split between micro-communities. In that case, the algorithm manages to get a better description of the community structure.","PeriodicalId":117542,"journal":{"name":"2014 IEEE Symposium on Computational Intelligence and Data Mining (CIDM)","volume":"43 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":"116606670","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
Optimization of the type-1 and interval type-2 fuzzy integrators in Ensembles of ANFIS models for prediction of the Dow Jones time series 基于ANFIS模型的1型和区间2型模糊积分器在道琼斯时间序列预测中的优化
2014 IEEE Symposium on Computational Intelligence and Data Mining (CIDM) Pub Date : 2014-12-01 DOI: 10.1109/CIDM.2014.7008666
Jesus Soto, P. Melin, O. Castillo
{"title":"Optimization of the type-1 and interval type-2 fuzzy integrators in Ensembles of ANFIS models for prediction of the Dow Jones time series","authors":"Jesus Soto, P. Melin, O. Castillo","doi":"10.1109/CIDM.2014.7008666","DOIUrl":"https://doi.org/10.1109/CIDM.2014.7008666","url":null,"abstract":"This paper describes the optimization of interval type-2 fuzzy integrators in Ensembles of ANFIS (adaptive neuro-fuzzy inferences systems) models for the prediction of the Dow Jones time series. The Dow Jones time series is used to the test of performance of the proposed ensemble architecture. We used the interval type-2 and type-1 fuzzy systems to integrate the output (forecast) of each Ensemble of ANFIS models. Genetic Algorithms (GAs) were used for the optimization of membership function parameters of each interval type-2 fuzzy integrator. In the experiments we optimized Gaussian, Generalized Bell and Triangular membership functions parameter for each of the fuzzy integrators, thereby increasing the complexity of the training. Simulation results show the effectiveness of the proposed approach.","PeriodicalId":117542,"journal":{"name":"2014 IEEE Symposium on Computational Intelligence and Data Mining (CIDM)","volume":"1 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":"125999159","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
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学术文献互助群
群 号:481959085
Book学术官方微信