نتایج جستجو برای: pattern discovery problem

تعداد نتایج: 1318153  

2001
Lida Tang Ben Shneiderman

Rapid growth of digital data collections is overwhelming the capabilities of humans to comprehend them without aid. The extraction of useful data from large raw data sets is something that humans do poorly. Aggregation is a technique that extracts important aspect from groups of data thus reducing the amount that the user has to deal with at one time, thereby enabling them to discover patterns,...

Journal: :Mendel ... 2023

Badminton is one of the most popular sports in world, especially Asia. It has a parent organization called World Federation (BWF). Discussion about player strategies winning various championships held by BWF an interesting topic to discuss. This paper aims analyze hitting patterns badminton players paying attention sequence types strokes made players, including lobs, netting, smashes, drives, a...

2005
Zhicheng Zhang

Pattern discovery and detection is that part of data mining concerned with finding ‘small, local’ structures in large data sets. Although many algorithms have been developed for such exercises, the discipline lacks a solid theoretical base comparable to that developed over the twentieth century for the modelling of large scale structures. Some of the issues of pattern discovery and detection ar...

2015
Shichao Zhang Chengqi Zhang

INTRODUCTION Multiple data source mining is the process of identifying potentially useful patterns from different data sources, or datasets (Zhang et al., 2003). Group pattern discovery systems for mining different data sources are based on local pattern-analysis strategy, mainly including logical systems for information enhancing, a pattern discovery system, and a post-pattern-analysis system.

Journal: :Global Journal of Human-Social Science 2020

Journal: :Algebraic combinatorics 2022

Drawing on a problem posed by Hertzsprung in 1887, we say that given permutation ?????? n contains the pattern ?????? k if there is factor ?(d+1)?(d+2)??(d+k) of ? such ?(d+1)-?(1)=?=?(d+k)-?(k). Using combination Goulden–Jackson cluster method and transfer-matrix determine joint distribution occurrences any set (incomparable) patterns, thus substantially generalizing earlier results Jackson et...

2007
Roger Nkambou Engelbert Mephu Nguifo Olivier Couturier Philippe Fournier-Viger

In an intelligent tutoring system (ITS), the domain expert should provide relevant domain knowledge to the tutor so that it will be able to guide the learner during problem solving. However, in several domains, this knowledge is not predetermined and should be captured or learned from expert users as well as intermediate and novice users. Our hypothesis is that, knowledge discovery (KD) techniq...

Journal: :International Journal of Computer Science and Informatics 2013

Journal: :Proceedings of the Japan Society of Civil Engineers 1978

Journal: :Theoretical Computer Science 2022

A 2-interval is the union of two disjoint intervals on real line. Two 2-intervals D1 and D2 are if their intersection empty (i.e., no interval intersects any D2). There can be three different relations between 2-intervals; namely, preceding (<), nested (⊏) crossing (≬). called R-comparable for some R∈{<,⊏,≬}, either D1RD2 or D2RD1. set D R-comparable, R⊆{<,⊏,≬} R≠∅, every pair in R∈R. Given a R...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید