دانلود و نمایش مقالات مرتبط با مفهوم رانش::صفحه 1
دانلود بهترین مقالات isi همراه با ترجمه فارسی 2

با سلام خدمت کاربران در صورتی که با خطای سیستم پرداخت بانکی مواجه شدید از طریق کارت به کارت (6037997535328901 بانک ملی ناصر خنجری ) مقاله خود را دریافت کنید (تا مشکل رفع گردد). 

نتیجه جستجو - مفهوم رانش

تعداد مقالات یافته شده: 5
ردیف عنوان نوع
1 A non-canonical hybrid metaheuristic approach to adaptive data stream classification
یک روش متاوریستی ترکیبی غیر متعارف برای طبقه بندی جریان داده تطبیقی-2020
Data stream classification techniques have been playing an important role in big data analytics recently due to their diverse applications (e.g. fraud and intrusion detection, forecasting and healthcare monitoring systems) and the growing number of real-world data stream generators (e.g. IoT devices and sensors, websites and social network feeds). Streaming data is often prone to evolution over time. In this context, the main challenge for computational models is to adapt to changes, known as concept drifts, using data mining and optimisation techniques. We present a novel ensemble technique called RED-PSO that seamlessly adapts to different concept drifts in non-stationary data stream classification tasks. RED-PSO is based on a three-layer architecture to produce classification types of different size, each created by randomly selecting a certain percentage of features from a pool of features of the target data stream. An evolutionary algorithm, namely, Replicator Dynamics (RD), is used to seamlessly adapt to different concept drifts; it allows good performing types to grow and poor performing ones to shrink in size. In addition, the selected feature combinations in all classification types are optimised using a non-canonical version of the Particle Swarm Optimisation (PSO) technique for each layer individually. PSO allows the types in each layer to go towards local (within the same type) and global (in all types) optimums with a specified velocity. A set of experiments are conducted to compare the performance of the proposed method to state-of-the-art algorithms using real-world and synthetic data streams in immediate and delayed prequential evaluation settings. The results show a favourable performance of our method in different environments.
Keywords: Ensemble learning | Data stream mining | Concept drifts | Bio-inspired algorithms | Non-stationary environments | Particle swarm optimisation | Replicator dynamics
مقاله انگلیسی
2 Machine learning based concept drift detection for predictive maintenance
مفهوم یادگیری ماشین مبتنی بر تشخیص رانش برای تعمیر و نگهداری پیشگویانه-2019
In this work we present a machine learning based approach for detecting drifting behavior – so-called concept drifts – in continuous data streams. The motivation for this contribution originates from the currently intensively investigated topic Predictive Maintenance (PdM), which refers to a proactive way of triggering servicing actions for industrial machinery. The aim of this maintenance strategy is to identify wear and tear, and consequent malfunctioning by analyzing condition monitoring data, recorded by sensor equipped machinery, in real-time. Recent developments in this area have shown potential to save time and material by preventing breakdowns and improving the overall predictability of industrial processes. However, due to the lack of high quality monitoring data and only little experience concerning the applicability of analysis methods, real-world implementations of Predictive Maintenance are still rare. Within this contribution, we present a method, to detect concept drift in data streams as potential indication for defective system behavior and depict initial tests on synthetic data sets. Further on, we present a real-world case study with industrial radial fans and discuss promising results gained from applying the detailed approach in this scope.
Keywords: Predictive maintenance | Machine learning | Concept drift detection | Time series regression | Industrial radial fans
مقاله انگلیسی
3 LSC: Online auto-update smart contracts for fortifying blockchain-based log systems
LSC: به روز رسانی خودکار قراردادهای هوشمند برای تقویت سیستم های ورود به سیستم بلاکچین-2019
Smart contracts allow verifiable operations to be executed in blockchains, bringing new possibilities for trust establishment in trustless scenarios. However, smart contracts are cumbersome when used as security mechanisms in security scenarios due to two reasons: they have limited power and are inert to changes . In order to mitigate the two problems of employed smart contracts, we propose LSC, a framework for online auto-update smart contracts in blockchain-based log systems, to en- able self-adaptive log anomaly detection via smart contracts. Time-varying log anomaly de- tection patterns are extracted by self-adaptive machine learning log anomaly analysis and are continuously fed to the contracts. The framework allows smart contracts to be auto- matically updated to express the patterns in low-cost ways. The anomaly detection strate- gies for audit log systems are shared and collaboratively enforced amongst network nodes to defend against targeted detection evasion. We provide a plain prototype as a proof of the feasibility and efficiency of LSC in log system.
Keywords: Smart contracts | Anomaly detectiony | Blockchain security | Security dynamics | Concept drift
مقاله انگلیسی
4 The Gradual Resampling Ensemble for mining imbalanced data streams with concept drift
اثر کلی مجموعه تلفیقی گسسته برای کاوش معادلات ناپایدار جریان با مفهوم رانش-2018
Knowledge extraction from data streams has received increasing interest in recent years. However, most of the existing studies assume that the class distribution of data streams is relatively balanced. The reac tion of concept drifts is more difficult if a data stream is class imbalanced. Current oversampling methods generally selectively absorb the previously received minority examples into the current minority set by evaluating similarities of past minority examples and the current minority set. However, the similarity evaluation is easily affected by data difficulty factors. Meanwhile, these oversampling techniques have ignored the majority class distribution, thus risking class overlapping. To overcome these issues, we propose an ensemble classifier called Gradual Resampling Ensemble (GRE). GRE could handle data streams which exhibit concept drifts and class imbalance. On the one hand, a selectively resampling method, where drifting data can be avoidable, is applied to select a part of pre vious minority examples for amplifying the current minority set. The disjuncts can be discovered by the DBSCAN clustering, and thus the influences of small disjuncts and outliers on the similarity evaluation can be avoidable. Only those minority examples with low probability of overlapping with the current majority set can be selected for resampling the current minority set. On the other hand, previous com ponent classifiers are updated using latest instances. Thus, the ensemble could quickly adapt to a new condition, regardless types of concept drifts. Through the gradual oversampling of previous chunks us ing the current minority events, the class distribution of past chunks can be balanced. Favorable results in comparison to other algorithms suggest that GRE can maintain good performance on minority class, without sacrificing majority class performance.
Keywords: Concept drift ، Data stream mining ، Ensemble classifier ، Class imbalance
مقاله انگلیسی
5 Countering the concept-drift problems in big data by an incrementally optimized stream mining model
مقابله با مشکلات مفهوم رانش در داده های بزرگ توسط یک مدل کاوش جریان بهینه سازی شده بصورت افزایشی-2015
Article history:Received 7 March 2014Revised 29 May 2014Accepted 6 July 2014 Available online 22 July 2014Keywords:Concept driftData stream mining Very fast decision treeMining the potential value hidden behind big data has been a popular research topic around the world. For an infinite big data scenario, the underlying data distribution of newly arrived data may be appeared differently from the old one in the real world. This phenomenon is so-called the concept-drift problem that exists commonly in the scenario of big data mining. In the past decade, decision tree inductions use multi-tree learning to detect the drift using alternative trees as a solution. However, multi-tree algorithms consume more computing resources than the singletree. This paper proposes a singletree with an optimized node-splitting mechanism to detect the drift in a test-then-training tree-building process. In the experiment, we compare the performance of the new method to some state-of-art singletree and multi-tree algorithms. Result shows that the new algorithm performs with good accuracy while a more compact model size and less use of memory than the others.© 2014 Elsevier Inc. All rights reserved.
Keywords: Concept drift | Data stream mining | Very fast decision tree
مقاله انگلیسی
rss مقالات ترجمه شده rss مقالات انگلیسی rss کتاب های انگلیسی rss مقالات آموزشی
logo-samandehi
بازدید امروز: 5160 :::::::: بازدید دیروز: 3097 :::::::: بازدید کل: 39427 :::::::: افراد آنلاین: 56