Informacja

Drogi użytkowniku, aplikacja do prawidłowego działania wymaga obsługi JavaScript. Proszę włącz obsługę JavaScript w Twojej przeglądarce.

Wyszukujesz frazę "data mining" wg kryterium: Temat


Wyświetlanie 1-7 z 7
Tytuł:
Combining classifiers for foreign pattern rejectionCombining classifiers for foreign pattern rejection
Autorzy:
Homenda, Władysław
Jastrzębska, Agnieszka
Pedrycz, Witold
Yu, Fusheng
Powiązania:
https://bibliotekanauki.pl/articles/1837475.pdf
Data publikacji:
2020
Wydawca:
Społeczna Akademia Nauk w Łodzi. Polskie Towarzystwo Sieci Neuronowych
Tematy:
data mining
knowledge engineering
Opis:
In this paper, we look closely at the issue of contaminated data sets, where apart from legitimate (proper) patterns we encounter erroneous patterns. In a typical scenario, the classification of a contaminated data set is always negatively influenced by garbage patterns (referred to as foreign patterns). Ideally, we would like to remove them from the data set entirely. The paper is devoted to comparison and analysis of three different models capable to perform classification of proper patterns with rejection of foreign patterns. It should be stressed that the studied models are constructed using proper patterns only, and no knowledge about thecharacteristics of foreign patterns is needed. The methods are illustrated with a case study of handwritten digits recognition, but the proposed approach itself is formulated in a general manner. Therefore, it can be applied to different problems. We have distinguished three structures: global, local, and embedded, all capable to eliminate foreign patterns while performing classification of proper patterns at the same time. A comparison of the proposed models shows that the embedded structure provides the best results but at the cost of a relatively high model complexity. The local architecture provides satisfying results and at the same time is relatively simple.
Źródło:
Journal of Artificial Intelligence and Soft Computing Research; 2020, 10, 2; 75-94
2083-2567
2449-6499
Pojawia się w:
Journal of Artificial Intelligence and Soft Computing Research
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
A new method for automatic determining of the DBSCAN parameters
Autorzy:
Starczewski, Artur
Goetzen, Piotr
Er, Meng Joo
Powiązania:
https://bibliotekanauki.pl/articles/1837535.pdf
Data publikacji:
2020
Wydawca:
Społeczna Akademia Nauk w Łodzi. Polskie Towarzystwo Sieci Neuronowych
Tematy:
clustering algorithms
DBSCAN
data mining
Opis:
Clustering is an attractive technique used in many fields in order to deal with large scale data. Many clustering algorithms have been proposed so far. The most popular algorithms include density-based approaches. These kinds of algorithms can identify clusters of arbitrary shapes in datasets. The most common of them is the Density-Based Spatial Clustering of Applications with Noise (DBSCAN). The original DBSCAN algorithm has been widely applied in various applications and has many different modifications. However, there is a fundamental issue of the right choice of its two input parameters, i.e the eps radius and the MinPts density threshold. The choice of these parameters is especially difficult when the density variation within clusters is significant. In this paper, a new method that determines the right values of the parameters for different kinds of clusters is proposed. This method uses detection of sharp distance increases generated by a function which computes a distance between each element of a dataset and its k-th nearest neighbor. Experimental results have been obtained for several different datasets and they confirm a very good performance of the newly proposed method.
Źródło:
Journal of Artificial Intelligence and Soft Computing Research; 2020, 10, 3; 209-221
2083-2567
2449-6499
Pojawia się w:
Journal of Artificial Intelligence and Soft Computing Research
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
A novel grid-based clustering algorithm
Autorzy:
Starczewski, Artur
Scherer, Magdalena M.
Książek, Wojciech
Dębski, Maciej
Wang, Lipo
Powiązania:
https://bibliotekanauki.pl/articles/2031101.pdf
Data publikacji:
2021
Wydawca:
Społeczna Akademia Nauk w Łodzi. Polskie Towarzystwo Sieci Neuronowych
Tematy:
data mining
grid-based clustering
grid structure
Opis:
Data clustering is an important method used to discover naturally occurring structures in datasets. One of the most popular approaches is the grid-based concept of clustering algorithms. This kind of method is characterized by a fast processing time and it can also discover clusters of arbitrary shapes in datasets. These properties allow these methods to be used in many different applications. Researchers have created many versions of the clustering method using the grid-based approach. However, the key issue is the right choice of the number of grid cells. This paper proposes a novel grid-based algorithm which uses a method for an automatic determining of the number of grid cells. This method is based on the kdist function which computes the distance between each element of a dataset and its kth nearest neighbor. Experimental results have been obtained for several different datasets and they confirm a very good performance of the newly proposed method.
Źródło:
Journal of Artificial Intelligence and Soft Computing Research; 2021, 11, 4; 319-330
2083-2567
2449-6499
Pojawia się w:
Journal of Artificial Intelligence and Soft Computing Research
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Minig rules of concept drift using genetic algorithm
Autorzy:
Vivekanandan, P.
Nedunchezhian, R.
Powiązania:
https://bibliotekanauki.pl/articles/91705.pdf
Data publikacji:
2011
Wydawca:
Społeczna Akademia Nauk w Łodzi. Polskie Towarzystwo Sieci Neuronowych
Tematy:
genetic algorithm
CDR-tree algorithm
rules
data mining
Opis:
In a database the data concepts changes over time and this phenomenon is called as concept drift. Rules of concept drift describe how the concept changes and sometimes they are interesting and mining those rules becomes more important. CDR tree algorithm is currently used to identify the rules of concept drift. Building a CDR tree becomes a complex process when the domain values of the attributes get increased. Genetic Algorithms are traditionally used for data mining tasks. In this paper, a Genetic Algorithm based approach is proposed for mining the rules of concept drift, which makes the mining task simpler and accurate when compared with the CDR-tree algorithm.
Źródło:
Journal of Artificial Intelligence and Soft Computing Research; 2011, 1, 2; 135-145
2083-2567
2449-6499
Pojawia się w:
Journal of Artificial Intelligence and Soft Computing Research
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
A novel drift detection algorithm based on features’ importance analysis in a data streams environment
Autorzy:
Duda, Piotr
Przybyszewski, Krzysztof
Wang, Lipo
Powiązania:
https://bibliotekanauki.pl/articles/1837417.pdf
Data publikacji:
2020
Wydawca:
Społeczna Akademia Nauk w Łodzi. Polskie Towarzystwo Sieci Neuronowych
Tematy:
data stream mining
random forest
features importance
Opis:
The training set consists of many features that influence the classifier in different degrees. Choosing the most important features and rejecting those that do not carry relevant information is of great importance to the operating of the learned model. In the case of data streams, the importance of the features may additionally change over time. Such changes affect the performance of the classifier but can also be an important indicator of occurring concept-drift. In this work, we propose a new algorithm for data streams classification, called Random Forest with Features Importance (RFFI), which uses the measure of features importance as a drift detector. The RFFT algorithm implements solutions inspired by the Random Forest algorithm to the data stream scenarios. The proposed algorithm combines the ability of ensemble methods for handling slow changes in a data stream with a new method for detecting concept drift occurrence. The work contains an experimental analysis of the proposed algorithm, carried out on synthetic and real data.
Źródło:
Journal of Artificial Intelligence and Soft Computing Research; 2020, 10, 4; 287-298
2083-2567
2449-6499
Pojawia się w:
Journal of Artificial Intelligence and Soft Computing Research
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
A data mining approach to improve military demand forecasting
Autorzy:
Thiagarajan, R.
Rahman, M.
Gossink, N.
Calbert, G.
Powiązania:
https://bibliotekanauki.pl/articles/91684.pdf
Data publikacji:
2014
Wydawca:
Społeczna Akademia Nauk w Łodzi. Polskie Towarzystwo Sieci Neuronowych
Tematy:
critical stocks
demand
forecasting
military operation
military planning
military supplies
autocorrelated
cross-correlated
data mining
Opis:
Accurately forecasting the demand of critical stocks is a vital step in the planning of a military operation. Demand prediction techniques, particularly autocorrelated models, have been adopted in the military planning process because a large number of stocks in the military inventory do not have consumption and usage rates per platform (e.g., ship). However, if an impending military operation is (significantly) different from prior campaigns then these prediction models may under or over estimate the demand of critical stocks leading to undesired operational impacts. To address this, we propose an approach to improve the accuracy of demand predictions by combining autocorrelated predictions with cross-correlated demands of items having known per-platform usage rates. We adopt a data mining approach using sequence rule mining to automatically determine crosscorrelated demands by assessing frequently co-occurring usage patterns. Our experiments using a military operational planning system indicate a considerable reduction in the prediction errors across several categories of military supplies.
Źródło:
Journal of Artificial Intelligence and Soft Computing Research; 2014, 4, 3; 205-214
2083-2567
2449-6499
Pojawia się w:
Journal of Artificial Intelligence and Soft Computing Research
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
A strong and efficient baseline for vehicle re-identification using deep triplet embedding
Autorzy:
Kumar, Ratnesh
Weill, Edwin
Aghdasi, Farzin
Sriram, Parthasarathy
Powiązania:
https://bibliotekanauki.pl/articles/91741.pdf
Data publikacji:
2020
Wydawca:
Społeczna Akademia Nauk w Łodzi. Polskie Towarzystwo Sieci Neuronowych
Tematy:
convolutional neural networks
re-identification
triplet networks
siamese networks
embedding
hard data mining
contrastive loss
konwolucyjne sieci neuronowe
sieci triplet
sieci syjamskie
osadzanie
eksploracja danych
Opis:
In this paper we tackle the problem of vehicle re-identification in a camera network utilizing triplet embeddings. Re-identification is the problem of matching appearances of objects across different cameras. With the proliferation of surveillance cameras enabling smart and safer cities, there is an ever-increasing need to re-identify vehicles across cameras. Typical challenges arising in smart city scenarios include variations of viewpoints, illumination and self occlusions. Most successful approaches for re-identification involve (deep) learning an embedding space such that the vehicles of same identities are projected closer to one another, compared to the vehicles representing different identities. Popular loss functions for learning an embedding (space) include contrastive or triplet loss. In this paper we provide an extensive evaluation of triplet loss applied to vehicle re-identification and demonstrate that using the recently proposed sampling approaches for mining informative data points outperform most of the existing state-of-the-art approaches for vehicle re-identification. Compared to most existing state-of-the-art approaches, our approach is simpler and more straightforward for training utilizing only identity-level annotations, along with one of the smallest published embedding dimensions for efficient inference. Furthermore in this work we introduce a formal evaluation of a triplet sampling variant (batch sample) into the re-identification literature. In addition to the conference version [24], this submission adds extensive experiments on new released datasets, cross domain evaluations and ablation studies.
Źródło:
Journal of Artificial Intelligence and Soft Computing Research; 2020, 10, 1; 27-45
2083-2567
2449-6499
Pojawia się w:
Journal of Artificial Intelligence and Soft Computing Research
Dostawca treści:
Biblioteka Nauki
Artykuł
    Wyświetlanie 1-7 z 7

    Ta witryna wykorzystuje pliki cookies do przechowywania informacji na Twoim komputerze. Pliki cookies stosujemy w celu świadczenia usług na najwyższym poziomie, w tym w sposób dostosowany do indywidualnych potrzeb. Korzystanie z witryny bez zmiany ustawień dotyczących cookies oznacza, że będą one zamieszczane w Twoim komputerze. W każdym momencie możesz dokonać zmiany ustawień dotyczących cookies