Ograniczanie wyników
Czasopisma help
Lata help
Autorzy help
Preferencje help
Widoczny [Schowaj] Abstrakt
Liczba wyników
Znaleziono wyników: 34
first rewind previous Strona / 2 next fast forward last
Wyszukiwano:
w słowach kluczowych:  association rules
help Sortuj według:

help Ogranicz wyniki do:
1
100%
Computer Methods in Materials Science
PL W ramach niniejszej pracy przeprowadzono eksplorację danych, pochodzących z procesu otrzymywania miedzi w piecu zawiesinowym. Celem pracy było odszukanie reguł asocjacyjnych występujących pomiędzy wybranymi parametrami wyjściowymi procesu - stężeniem miedzi w żużlu i stężeniem ołowiu w miedzi - a pa[...]
EN The paper presents an attempt of the exploration of data sets collected in the copper flash smelting process. The goal of the research was to find the association rules occurring between selected output parameters of the process – copper concentration in the slag and lead concentration in blister co[...]
2
100%
Fundamenta Informaticae
EN Partial association rules can be used for representation of knowledge, for inference in expert systems, for construction of classifiers, and for filling missing values of attributes. This paper is devoted to the study of approximate algorithms for minimization of partial association rule length. It [...]
3
100%
Foundations of Computing and Decision Sciences
EN Database mining is the process of extracting interesting and previously unknown patterns and correlations from data stored in Data Base Management Systems (DBMSs). Association rule mining is the process of discovering items, which tend to occur together in transactions. If the data to be mined were [...]
4
100%
Fundamenta Informaticae
EN This paper deals with an idea of the use of data mining approach in texture analysis. A new method based on association rules is proposed. This method utilizes the multiresolution analysis of an analyzed image texture and works at the texture primitive level. Within this method, a technique for feat[...]
5
100%
Fundamenta Informaticae
EN DataMining is most commonly used in attempts to induce association rules fromtransaction data which can help decision-makers easily analyze the data and make good decisions regarding the domains concerned. Most conventional studies are focused on binary or discrete-valued transaction data, however t[...]
6
88%
Fundamenta Informaticae
EN This paper is devoted to the study of approximate algorithms for minimization of the total weight of attributes occurring in partial association rules. We consider mainly greedy algorithms with weights for construction of rules. The paper contains bounds on precision of these algorithms and bounds o[...]
7
88%
Informatyka Teoretyczna i Stosowana
EN One of the biggest problems in Data Mining is scalability of developed solutions. It is implied by the following factors: amount of data, splitting data on partitions, curse of dimensionality, many different types of data in the same repository, data neighbourhood and many others. In this paper we p[...]
8
88%
Fundamenta Informaticae
EN In this paper, we investigate interpolation methods that are suitable for discovering spatiotemporal association rules for unsampled sites with a focus on drought risk management problem. For drought risk management, raw weather data is collected, converted to various indices, and then mined for ass[...]
9
88%
Fundamenta Informaticae
2015 Vol. 137, nr 2 171--217
EN A formal framework for data mining with association rules is introduced. The framework is based on a logical calculus of association rules which is enhanced by several formal tools. The enhancement allows the description of the whole data mining process, including formulation of analytical questions[...]
10
88%
Fundamenta Informaticae
EN In the paper, an application of dynamic programming approach for optimization of association rules from the point of view of knowledge representation is considered. The association rule set is optimized in two stages, first for minimum cardinality and then for minimum length of rules. Experimental r[...]
11
88%
Fundamenta Informaticae
EN Association rules are introduced as general relations of two general Boolean attributes derived from columns of an analysed data matrix. Expressive power of such association rules makes possible to use various items of domain knowledge in data mining. Each particular item of domain knowledge is mapp[...]
12
88%
Fundamenta Informaticae
EN In this paper, seven greedy heuristics for construction of association rules are compared from the point of view of the length and coverage of constructed rules. The obtained rules are compared also with optimal ones constructed by dynamic programming algorithms. The average relative difference betw[...]
13
75%
Control and Cybernetics
EN One of the crucial problems in the field of knowledge discovery is development of good interestingness measures for evaluation of the discovered patterns. In this paper, we consider quantitative, objective interestingness measures for "if..., then... " association rules. We focus on three popular in[...]
14
75%
Przegląd Elektrotechniczny
2013 R. 89, nr 4 176-179
PL W artykule opisano metodę wykrywania wyładowań niezupełnych, poprzez wyznaczenie reguł powiązanych z wystąpieniem tych wyładowań i ich wyszukiwanie. Dzięki analizie statystycznej danych dotyczących stanów nieustalonych napięcia oraz zastosowaniu algorytmu apriori, określono zasady powiązane z wystąp[...]
EN In the paper, a new partial discharge pattern recognition approach based on association rules mining is developed. Some statistical parameters are extracted from the sampled transient earth voltage data and classic Apriori algorithm is employed to mine the association rules between those parameters [...]
15
75%
Studia Informatica
PL W artykule przedstawiono sposób konstruowania częściowych reguł asocjacyjnych z wykorzystaniem algorytmu zachłannego. Podejście to jest odmienne od znanego algorytmu A priori i jego modyfikacji, wykorzystujących zbiory częste. Przedstawione wyniki badań oraz rezultaty z przeprowadzonych eksperymentó[...]
EN The paper presents greedy algorithm for partial association rule construction. This approach is different from the known algorithm Apriori and its modifications based on frequent itemsets. Theoretical and experimental results show, that the greedy algorithm constructs relatively small number of sho[...]
16
75%
Hutnik, Wiadomości Hutnicze
PL W pracy przedstawione zostały wyniki analizy zawiesinowego procesu otrzymywania miedzi uzyskane przy użyciu wybranych metod eksploracji danych. Analiza przeprowadzona została jedynie dla wybranych parametrów. Wyniki analizy posłużyły do utworzenia odpowiednich reguł asocjacyjnych z wybranych paramet[...]
EN The paper present the results of the data mining analysis of the copper flash smelting process. Only chosen process parameters were considered. The obtained results formed the appropriate association rules between chosen input and the temperatures of the process output parameters. The data mining an[...]
17
75%
Fundamenta Informaticae
EN Formal concept analysis and probability logic are two useful tools for data analysis. Data is usually represented as a two-dimensional context of objects and features. FCA discovers dependencies within the data based on the relation among objects and features. On the other hand, the probability logi[...]
18
75%
International Journal of Applied Mathematics and Computer Science
EN Based on rough set theory many algorithms for rules extraction from data have been proposed. Decision rules can be obtained directly from a database. Some condition values may be unnecessary in a decision rule produced directly from the database. Such values can then be eliminated to create a more c[...]
19
75%
Studia Informatica : systems and information technology
2008 Vol. 1(10) 87--93
EN Existing algorithms for finding association rules do not implement parallel processing. This paper proposes CFP-SFP (Creating Frequent Patterns with Set from Frequent Patterns) algorithm with parallel processing. The research involves running CEP-SEP algorithm with one thread and a dozen or so threa[...]
20
75%
Studia Informatica
PL Artykuł opisuje dwa algorytmy odkrywania reguł asocjacji z zachowaniem prywatności danych, HPSU i VPSI. Przedstawia on problem ochrony prywatności danych w rozproszonych obliczeniach i ewolucje modelu bezpiecznych obliczeń. Zaprezentowana jest również krótka charakterystyka odkrywania reguł asocjacj[...]
EN The article presents two algorithms of association nile mining with pre-serving data privacy, HPSU and VPSI. It introduces the problem of data privacy in distributed computation and shows the evolution of secure computation model. Used methods in algorithms arę briefly reviewed. Finally the results [...]
first rewind previous Strona / 2 next fast forward last