Informacja

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

English (EN)·Polski (PL)·Yкраїнський (UK)
Przejdź do strony domowej biblioteki Centralna Biblioteka Wojskowa Link otwiera się w nowym oknie Logo biblioteki Prolib Integro - strona głównaCentralna Biblioteka Wojskowa

Wyszukujesz frazę "sequential data" wg kryterium: Temat

  Lista filtrów
Wyrównaj
    Wyświetlanie 1-8 z 8
    Tytuł:
    Formal model of time point-based sequential data for OLAP-like analysis
    Autorzy:
    Bębel, B.
    Morzy, T.
    Królikowski, Z.
    Wrembel, R.
    Powiązania:
    https://bibliotekanauki.pl/articles/200403.pdf
    Data publikacji:
    2014
    Wydawca:
    Polska Akademia Nauk. Czytelnia Czasopism PAN
    Tematy:
    OLAP
    sequential data
    formal model
    Opis:
    Numerous nowadays applications generate huge sets of data, whose natural feature is order, e.g,. sensor installations, RFID devices, workflow systems, Website monitors, health care applications. By analyzing the data and their order dependencies one can acquire new knowledge. However, nowadays commercial BI technologies and research prototypes allow to analyze mostly set oriented data, neglecting their order (sequential) dependencies. Few approaches to analyzing data of sequential nature have been proposed so far and all of them lack a comprehensive data model being able to represent and analyze sequential dependencies. In this paper, we propose a formal model for time point-based sequential data. The main elements of this model include an event and a sequence of events. Measures are associated with events and sequences. Measures are analyzed in the context set up by dimensions in an OLAP-like manner by means of the set of operations. The operations in our model are categorized as: operations on sequences, on dimensions, general operations, and analytical functions.
    Źródło:
    Bulletin of the Polish Academy of Sciences. Technical Sciences; 2014, 62, 2; 331-340
    0239-7528
    Pojawia się w:
    Bulletin of the Polish Academy of Sciences. Technical Sciences
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    How to improve efficiency of analysis of sequential data?
    Autorzy:
    Andrzejewski, W.
    Królikowski, Z.
    Morzy, T.
    Powiązania:
    https://bibliotekanauki.pl/articles/970825.pdf
    Data publikacji:
    2009
    Wydawca:
    Polska Akademia Nauk. Instytut Badań Systemowych PAN
    Tematy:
    sequential data
    indexing
    market basket analysis
    Opis:
    Many of todays database applications, including market basket analysis, web log analysis, DNA and protein sequence analysis utilize databases to store and retrieve sequential data. Commercial database management systems allow to store sequential data, but they do not support efficient querying of such data. To increase the efficiency of analysis of sequential data new index structures need to be developed. In this paper we propose an indexing scheme for non-timestamped sequences of sets, which supports set subsequence queries. Our contribution is threefold. First, we describe the index logical and physical structure, second, we provide algorithms for set subsequence queries utilizing this structure, and finally we perform experimental evaluation of the index, which proves its feasibility and advantages in set subsequence query processing.
    Źródło:
    Control and Cybernetics; 2009, 38, 1; 107-126
    0324-8569
    Pojawia się w:
    Control and Cybernetics
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    A new approach for discovering top-k sequential patterns based on the variety of items
    Autorzy:
    Sakurai, S.
    Nishizawa, M.
    Powiązania:
    https://bibliotekanauki.pl/articles/91708.pdf
    Data publikacji:
    2015
    Wydawca:
    Społeczna Akademia Nauk w Łodzi. Polskie Towarzystwo Sieci Neuronowych
    Tematy:
    sequential data
    sequential patterns
    synthetic sequential data
    numerical experiment
    top-k
    dane sekwencyjne
    wzorce sekwencyjne
    syntetyczne dane sekwencyjne
    eksperyment numeryczny
    Opis:
    This paper proposes a method that discovers various sequential patterns from sequential data. The sequential data is a set of sequences. Each sequence is a row of item sets. Many previous methods discover frequent sequential patterns from the data. However, the patterns tend to be similar to each other because they are composed of limited items. The patterns do not always correspond to the interests of analysts. Therefore, this paper tackles on the issue discovering various sequential patterns. The proposed method decides redundant sequential patterns by evaluating the variety of items and deletes them based on three kinds of delete processes. It can discover various sequential patterns within the upper bound for the number of sequential patterns given by the analysts. This paper applies the method to the synthetic sequential data which is characterized by number of items, their kind, and length of sequence. The effect of the method is verified through numerical experiments.
    Źródło:
    Journal of Artificial Intelligence and Soft Computing Research; 2015, 5, 2; 141-153
    2083-2567
    2449-6499
    Pojawia się w:
    Journal of Artificial Intelligence and Soft Computing Research
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Sequential Classification of Palm Gestures Based on A* Algorithm and MLP Neural Network for Quadrocopter Control
    Autorzy:
    Wodziński, M.
    Krzyżanowska, A.
    Powiązania:
    https://bibliotekanauki.pl/articles/221525.pdf
    Data publikacji:
    2017
    Wydawca:
    Polska Akademia Nauk. Czytelnia Czasopism PAN
    Tematy:
    machine learning
    shortest path
    sequential data
    quadrocopter
    GPU
    CUDA
    Opis:
    This paper presents an alternative approach to the sequential data classification, based on traditional machine learning algorithms (neural networks, principal component analysis, multivariate Gaussian anomaly detector) and finding the shortest path in a directed acyclic graph, using A* algorithm with a regression-based heuristic. Palm gestures were used as an example of the sequential data and a quadrocopter was the controlled object. The study includes creation of a conceptual model and practical construction of a system using the GPU to ensure the realtime operation. The results present the classification accuracy of chosen gestures and comparison of the computation time between the CPU- and GPU-based solutions.
    Źródło:
    Metrology and Measurement Systems; 2017, 24, 2; 265-276
    0860-8229
    Pojawia się w:
    Metrology and Measurement Systems
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Mining Pharmacy Database Using Evolutionary Genetic Algorithm
    Autorzy:
    Ykhlef, M.
    ElGibreen, H.
    Powiązania:
    https://bibliotekanauki.pl/articles/226717.pdf
    Data publikacji:
    2010
    Wydawca:
    Polska Akademia Nauk. Czytelnia Czasopism PAN
    Tematy:
    data mining
    evolutionary algorithms
    genetic algorithm
    pharmacy database
    sequential patterns
    Opis:
    Medication management is an important process in pharmacy field. Prescribing errors occur upstream in the process, and their effects can be perpetuated in subsequent steps. Prescription errors are an important issue for which conflicts with another prescribed medicine could cause severe harm for a patient. In addition, due to the shortage of pharmacists and to contain the cost of healthcare delivery, time is also an important issue. Former knowledge of prescriptions can reduce the errors, and discovery of such knowledge requires data mining techniques, such as Sequential Pattern. Moreover, Evolutionary Algorithms, such as Genetic Algorithm (GA), can find good rules in short time, thus it can be used to discover the Sequential Patterns in Pharmacy Database. In this paper GA is used to assess patient prescriptions based on former knowledge of series of prescriptions in order to extract sequenced patterns and predict unusual activities to reduce errors in timely manner.
    Źródło:
    International Journal of Electronics and Telecommunications; 2010, 56, 4; 427-432
    2300-1933
    Pojawia się w:
    International Journal of Electronics and Telecommunications
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Wydzielanie grup miejscowości na podstawie serii doświadczeń wielokrotnych ze zmiennym składem odmian w latach przy użyciu pakietu SEQRET. Część II. Przykład dla plonu ziarna z doświadczeń przedrejestrowych z pszenicą ozimą
    The clustering of locations based on multi-environment trials with different cultivars across years using the SEQRET package. Part II. An example for grain yield from winter wheat pre-registration trials
    Autorzy:
    Rajfura, Anna
    Mądry, Wiesław
    Drzazga, Tadeusz
    Iwańska, Marzena
    Powiązania:
    https://bibliotekanauki.pl/articles/41515584.pdf
    Data publikacji:
    2008
    Wydawca:
    Instytut Hodowli i Aklimatyzacji Roślin
    Tematy:
    pakiet SEQRET
    retrospektywna sekwencyjna analiza wzorca
    niekompletne historyczne bazy danych
    uśrednione zredukowane macierze odległości
    SEQRET package
    retrospective sequential pattern analysis
    unbalanced historical data sets
    averaged reduced proximity matrices
    Opis:
    W pracy przedstawiono zastosowanie metod analizy wzorca do wydzielenia grup miejscowości dla niekompletnych danych z doświadczeń przedrejestrowych z pszenicą ozimą. Przy użyciu pakietu SEQRET wydzielono grupy miejscowości o podobnie różnicującym wpływie na odmiany oraz wyz-naczono współczynniki opisujące dopasowanie modelu. Praca prezentuje praktyczne zastosowanie metodyki, której teoretyczny opis zamieszczono w Części I.
    This work presents the example of using pattern analysis methods, which are appropriate to cluster locations for unbalanced historical data sets from multienvironmental series of experiments with winter wheat carried out for many years. The SEQRET package was used for clustering locations in the way by which they discriminate among genotypes, and for calculating determination coefficients for years. The paper presents the use of procedures described in a theoretical Part I in practice.
    Źródło:
    Biuletyn Instytutu Hodowli i Aklimatyzacji Roślin; 2008, 250; 145-153
    0373-7837
    2657-8913
    Pojawia się w:
    Biuletyn Instytutu Hodowli i Aklimatyzacji Roślin
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Object library of algorithms for dynamic optimization problems; Benchmarking SQP and nonlinear interior point methods
    Autorzy:
    Błaszczyk, J.
    Karbowski, A.
    Malinowski, K.
    Powiązania:
    https://bibliotekanauki.pl/articles/929795.pdf
    Data publikacji:
    2007
    Wydawca:
    Uniwersytet Zielonogórski. Oficyna Wydawnicza
    Tematy:
    optymalizacja dynamiczna
    programowanie kwadratowe sekwencyjne
    różniczkowanie automatyczne
    obliczenia numeryczne
    analiza danych
    dynamic optimization
    large-scale optimization
    sequential quadratic programming
    nonlinear interior-point methods
    object-oriented numerical computations
    automatic differentiation
    performance data analysis
    Opis:
    The main purpose of this paper is to describe the design, implementation and possibilities of our object-oriented library of algorithms for dynamic optimization problems. We briefly present library classes for the formulation and manipulation of dynamic optimization problems, and give a general survey of solver classes for unconstrained and constrained optimization. We also demonstrate methods of derivative evaluation that we used, in particular automatic differentiation. Further, we briefly formulate and characterize the class of problems solved by our optimization classes. The solution of dynamic optimization problems with general constraints is performed by transformation into structured large-scale nonlinear programming problems and applying methods for nonlinear optimization. Two main algorithms of solvers for constrained dynamic optimization are presented in detail: the sequential quadratic programming (SQP) exploring the multistage structure of the dynamic optimization problem during the solution of a sequence of quadratic subproblems, and the nonlinear interior-point method implemented in a general-purpose large-scale optimizer IPOPT. At the end, we include a typical numerical example of the application of the constrained solvers to a large-scale discrete-time optimal control problem and we use the performance profiles methodology to compare the efficiency and robustness of different solvers or different options of the same solver. In conclusions, we summarize our experience gathered during the library development.
    Źródło:
    International Journal of Applied Mathematics and Computer Science; 2007, 17, 4; 515-537
    1641-876X
    2083-8492
    Pojawia się w:
    International Journal of Applied Mathematics and Computer Science
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Theoretical Approaches for Safety Levels Measurements – Sequential Probability Ratio Test (SPRT)
    Autorzy:
    Kharchenko, Volodymyr
    Bugayko, Dmytro
    Antonova, Anna
    Grigorak, Maria
    Pawęska, Marcin
    Powiązania:
    https://bibliotekanauki.pl/articles/503798.pdf
    Data publikacji:
    2017
    Wydawca:
    Międzynarodowa Wyższa Szkoła Logistyki i Transportu
    Tematy:
    the International Civil Aviation Organization (ICAO)
    Standards and Recommended Practices (SARPs)
    safety of aviation
    safety management system, financial management
    safety space
    safety/protection boundary hypothesis
    theory
    Sequential Probability Ratio Test (SPRT)
    accidents and incidents reports, audits
    surveys
    flight data analysis (FDA)
    voluntary and involuntary reports and confidential communications
    Opis:
    The principles of civil aviation safety are considered. At present time, aviation is an ultra-safe system, (i.e. a system that experiences less than one catastrophic safety breakdown every one million production cycles). But, unfortunately, we can never state that aviation activities will be absolutely safe. In current conditions the increase of the civil aviation safety level is one of the principal objectives of the world air transport development. The paper pays special attention to the civil aviation threats and risks in the context of globalization processes. The investigation deals with problems of global implementation of Annex 19 to the Convention of the International Civil Aviation. Present research paper discusses new theoretical approaches to searching for methods to assess the “safety space” of civil aviation activity. Special attention is paid to an effective test, proposed by A. Wald.
    Źródło:
    Logistics and Transport; 2017, 34, 2; 25-32
    1734-2015
    Pojawia się w:
    Logistics and Transport
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
      Wyświetlanie 1-8 z 8

      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