Zobrazeno 1 - 10
of 11
pro vyhledávání: '"Mieczyslaw A. Klopotek"'
Publikováno v:
CEC
In this paper we make a comparison of two NMF based techniques of dataset characterization: clustering and hulling. The characteristics of a dataset should be understood as describing the content of a data set through several characteristic represent
Publikováno v:
ENIC
We propose a new version of an algorithm based on Dirichlet boundary for community detection under the assumption of partially pre-labelled community members. We present a complete mathematical derivation of this method from the continuous Dirichlet
Publikováno v:
ENIC
In this paper scalable and parallelized method for cluster analysis based on random walks is presented. The aim of the algorithm introduced in this paper is to detect dense sub graphs (clusters) and sparse sub graphs (bridges) which are responsible f
Autor:
Dariusz Czerski, Krzysztof Ciesielski, Michał Dramiński, Mieczyslaw A. Klopotek, Slawomir T. Wierzchon
Publikováno v:
WI-IAT (2)
In this paper a reflection on the relationships among random-walk-with-back step, lazy walk and traditional Page Rank is made. It is demonstrated that though all of them differ semantically, they still can be computed using the very same algorithm.
Publikováno v:
2013 Second International Conference on Informatics & Applications (ICIA).
This paper proposes application of Formal Concept Analysis (FCA) in creating character-level information extraction patterns and presents BigGrams: a prototype of a language-independent information extraction system. The main goal of the system is to
Publikováno v:
3rd International Conference on Human System Interaction.
The purpose of this article is to describe the performance related features of our tag recommending webservice. The service is one of several systems currently integrated with multiplexing recommender framework for Bibsonomy.org bookmarking portal. T
Publikováno v:
ARES
ResearcherID
ResearcherID
A reliable wireless ad hoc network has to be secured against a selfish behavior. In such a network environment nodes have no incentives to participate actively in packet forwarding. Thus, selfishness is a rational choice for network participants. In
Publikováno v:
IEEE Congress on Evolutionary Computation
Cooperation enforcement is one of the key issues in ad hoc networks. In this paper we proposes a new strategy driven approach that aims at discouraging selfish behavior among network participants. Each node is using a strategy that defines conditions
Publikováno v:
CISIM
One of the most vital problems of free-text document processing is the curse of dimensionality. The paper presents a dimensionality reduction algorithm based on informed feature selection. Terms describing the document are based on histogram-like sta
Publikováno v:
CIG
In this paper we address the problem of cooperation and selfish behavior in ad hoc networks. We present a new game theory based model to study cooperation between nodes. This model has some similarities with the iterated prisoner's dilemma under the