Serwis Infona wykorzystuje pliki cookies (ciasteczka). Są to wartości tekstowe, zapamiętywane przez przeglądarkę na urządzeniu użytkownika. Nasz serwis ma dostęp do tych wartości oraz wykorzystuje je do zapamiętania danych dotyczących użytkownika, takich jak np. ustawienia (typu widok ekranu, wybór języka interfejsu), zapamiętanie zalogowania. Korzystanie z serwisu Infona oznacza zgodę na zapis informacji i ich wykorzystanie dla celów korzytania z serwisu. Więcej informacji można znaleźć w Polityce prywatności oraz Regulaminie serwisu. Zamknięcie tego okienka potwierdza zapoznanie się z informacją o plikach cookies, akceptację polityki prywatności i regulaminu oraz sposobu wykorzystywania plików cookies w serwisie. Możesz zmienić ustawienia obsługi cookies w swojej przeglądarce.
Successful management of an information technology (IT) project is the most desirable for all organisations and stakeholders. Many researchers elaborated that risk management is a key part of project management for any project size. Risk management is so critical because it provides project managers with a forward-looking view of both threats and opportunities to improve the project success. The objectives...
This research article presents a new character-based indexing algorithm which generates all locations of target text to the inverted list in existed bit form. This algorithm is efficiently to search in the case of streaming character input that needs to immediately response.
Search engines on the Web have popularized the keyword-based search paradigm, while searching in databases users need to know a database schema and a query language. Keyword search techniques on the Web cannot directly be applied to databases because the data on the Internet and database are in different forms. So keyword search systems in relational databases have recently proposed. However existing...
This paper presents two algorithms of string pattern matching. These algorithms employ the inverted lists to accommodate the string pattern to be searched for. The first solution scans the text in a single pass for all occurrences of string pattern. The second solution, which improves the first one, takes the comparison times equal to the length of pattern plus the number of comparisons that lead...
In this paper, we propose to improve the SvS algorithm by skipping elements of the smaller set for reducing a search boundary. The boundary of skipped element is determined by boundaries of elements prior to and next to it. We perform experiments on uniformly distributed random datasets to compare our algorithm with the standard SvS. We use regression analysis to get an equation for determining an...
Search engines on the Web have popularized the keyword-based search paradigm, while searching in databases users need to know a database schema and a query language. Keyword search techniques on the Web cannot directly be applied to databases because the data on the Internet and database are in different forms. Moreover, existing systems for keyword searching limit type of keywords to database value...
In this paper, we propose a new mining of frequent itemsets algorithm, called SFI-mine algorithm. The SFI-mine constructs pattern-base by using a new method which is different from the conditional pattern-base in FP-growth, mines frequent itemsets with a new combination method without recursive construction of conditional FP-trees. It obtains complete and correct frequent itemsets. We have conducted...
In this paper, we propose an efficient algorithm, NCLOSED, for mining the N k-closed itemsets with the highest supports for 1 up to a certain kmax value. The algorithm adopts best-first search strategy to generate closed itemsets with highest remaining supports. It does not keep closed itemsets mined in main memory to ensure that they are really closed. This is because this algorithm can directly...
Rough set theory and formal concept analysis were invented by Pawlak and Wille in the 1980s and have been applied successfully in several domains. In this paper, we propose a new case-based classifier system based on an integrated rough set theory and formal concept analysis technique. We focus on the construction of a better knowledge base to produce the classification rules. Our system employs rough...
In this paper, we proposed an efficient algorithm, TOPK_CLOSED, for mining top-k closed itemsets. This algorithm mines top-k closed itemsets using best-first search. The closed itemsets with the highest supports are firstly found from this algorithm. Consequently, the method quickly finds top-k closed itemsets, which leads to an efficient pruning unnecessary itemsets and stop mining rapidly. In addition,...
The paper presents a new text transform algorithm suitable for embedding in compression algorithms. The strategy the new algorithm employed to increase performance of text compression is to replace words with predefined codes. Instead of using a huge dictionary containing exhaustive words as in previous works, the new algorithm uses a list of stoplists and/or frequent words. The research devised different...
This paper proposes a new intersection algorithm of sorted sets. The new algorithm employs a comparison- and-elimination approach to the intersection problem instead of using search algorithms as existing intersection solutions. It takes (1) O(T) times for the best case; (2) O(lambda) times for the average case, where lambda is an average size of sorted sets; and (3) O(kn) times for the worst case,...
This paper proposes a new algorithm to generate a minimal search space of the problem of coalition structure generation using a new optimal integer partition. The new partition includes only partitions giving optimal coalition structures. These partitions are those containing 1 at most one element. Our new algorithm generates optimal partition structures in two steps. The first step, we use a modified...
A combination of closed sequential pattern mining and closed itemset pattern mining was proposed to mine closed multidimensional sequential patterns. There are two ways for this combination; (1) mining closed itemset patterns from multidimensional information followed by mining closed sequential patterns from sequences associated with closed itemset patterns, and (2) mining closed sequential patterns...
In this paper, we propose a new hybrid case based reasoning system based on rough set theory, formal concept analysis and fuzzy sets. This system applies rough set theory to assure minimally sufficient cases in its case base. It uses formal concept analysis to reveal knowledge of attribute dependencies in terms of concept lattices. Numeric attributes are transformed to be suitable for formal concept...
We propose a new method, called closed multidimensional sequential pattern mining, for mining multidimensional sequential patterns. The new method is an integration of closed sequential pattern mining and closed itemset pattern mining. Based on this method, we show that (1) the number of complete closed multidimensional sequential patterns is not larger than the number of complete multidimensional...
Podaj zakres dat dla filtrowania wyświetlonych wyników. Możesz podać datę początkową, końcową lub obie daty. Daty możesz wpisać ręcznie lub wybrać za pomocą kalendarza.