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ę "Kazienko, P." wg kryterium: Autor


Wyświetlanie 1-4 z 4
Tytuł:
Multi-label classification using error correcting output codes
Autorzy:
Kajdanowicz, T.
Kazienko, P.
Powiązania:
https://bibliotekanauki.pl/articles/331286.pdf
Data publikacji:
2012
Wydawca:
Uniwersytet Zielonogórski. Oficyna Wydawnicza
Tematy:
maszyna ucząca się
uczenie nadzorowane
metoda agregacji
struktura ramowa
machine learning
supervised learning
multilabel classification
error correcting output codes
ECOC
ensemble methods
binary relevance
framework
Opis:
A framework for multi-label classification extended by Error Correcting Output Codes (ECOCs) is introduced and empirically examined in the article. The solution assumes the base multi-label classifiers to be a noisy channel and applies ECOCs in order to recover the classification errors made by individual classifiers. The framework was examined through exhaustive studies over combinations of three distinct classification algorithms and four ECOC methods employed in the multi-label classification problem. The experimental results revealed that (i) the Bode-Chaudhuri-Hocquenghem (BCH) code matched with any multi-label classifier results in better classification quality; (ii) the accuracy of the binary relevance classification method strongly depends on the coding scheme; (iii) the label power-set and the RAkEL classifier consume the same time for computation irrespective of the coding utilized; (iv) in general, they are not suitable for ECOCs because they are not capable to benefit from ECOC correcting abilities; (v) the all-pairs code combined with binary relevance is not suitable for datasets with larger label sets.
Źródło:
International Journal of Applied Mathematics and Computer Science; 2012, 22, 4; 829-840
1641-876X
2083-8492
Pojawia się w:
International Journal of Applied Mathematics and Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Privacy-preserving data mining, sharing and publishing
Autorzy:
Pasierb, K.
Kajdanowicz, T.
Kazienko, P.
Powiązania:
https://bibliotekanauki.pl/articles/333538.pdf
Data publikacji:
2011
Wydawca:
Uniwersytet Śląski. Wydział Informatyki i Nauki o Materiałach. Instytut Informatyki. Zakład Systemów Komputerowych
Tematy:
elektroniczna dokumentacja medyczna
udostępnianie danych medycznych
eksploracji danych medycznych
poufność danych
anonimowość
electronic medical record
medical data sharing
medical data mining
data confidentiality
privacy-preserving methods
anonymity
Opis:
The goal of the paper is to present different approaches to privacy-preserving data sharing and publishing in the context of e-health care systems. In particular, the literature review on technical issues in privacy assurance and current real-life high complexity implementation of medical system that assumes proper data sharing mechanisms are presented in the paper.
Źródło:
Journal of Medical Informatics & Technologies; 2011, 18; 69-76
1642-6037
Pojawia się w:
Journal of Medical Informatics & Technologies
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Evaluation of node position based on email communication
Autorzy:
Kazienko, P.
Musiał, K.
Zgrzywa, A.
Powiązania:
https://bibliotekanauki.pl/articles/970832.pdf
Data publikacji:
2009
Wydawca:
Polska Akademia Nauk. Instytut Badań Systemowych PAN
Tematy:
node position assessment
social network of email users
social network analysis
network analysis
centrality measure
Opis:
Rapid development of various kinds of social networks within the Internet enabled investigation of their properties and analyzing their structure. An interesting scientific problem in this domain is the assessment of the node position within the directed, weighted graph that represents the social network of email users. The new method of node position analysis, which takes into account both the node positions of the neighbors and the strength of connections between network nodes, is presented in the paper. The node position can be used to discover key network users, who are the most important in the population and who have potentially the greatest influence on others. The experiments carried out on two datasets enabled studying the main properties of the new measure.
Źródło:
Control and Cybernetics; 2009, 38, 1; 67-86
0324-8569
Pojawia się w:
Control and Cybernetics
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Mining indirect association rules for web recommendation
Autorzy:
Kazienko, P.
Powiązania:
https://bibliotekanauki.pl/articles/907860.pdf
Data publikacji:
2009
Wydawca:
Uniwersytet Zielonogórski. Oficyna Wydawnicza
Tematy:
reguły asocjacji
system zalecany
badanie sieci
association rules
indirect association rules
recommender system
web mining
web usage mining
Opis:
Classical association rules, here called 'direct', reflect relationships existing between items that relatively often co-occur in common transactions. In the web domain, items correspond to pages and transactions to user sessions. The main idea of the new approach presented is to discover indirect associations existing between pages that rarely occur together but there are other, 'third' pages, called transitive, with which they appear relatively frequently. Two types of indirect associations rules are described in the paper: partial indirect associations and complete ones. The former respect single transitive pages, while the latter cover all existing transitive pages. The presented IDARM* Algorithm extracts complete indirect association rules with their important measure-confidence-using pre-calculated direct rules. Both direct and indirect rules are joined into one set of complex association rules, which may be used for the recommendation of web pages. Performed experiments revealed the usefulness of indirect rules for the extension of a typical recommendation list. They also deliver new knowledge not available to direct ones. The relation between ranking lists created on the basis of direct association rules as well as hyperlinks existing on web pages is also examined.
Źródło:
International Journal of Applied Mathematics and Computer Science; 2009, 19, 1; 165-186
1641-876X
2083-8492
Pojawia się w:
International Journal of Applied Mathematics and Computer Science
Dostawca treści:
Biblioteka Nauki
Artykuł
    Wyświetlanie 1-4 z 4

    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