Читать книгу Data Mining and Machine Learning Applications - Группа авторов - Страница 48
2.2.8 Mining Sequential Data
ОглавлениеSequential Data is inescapable. Client shopping groupings, clinical treatment information, and Information identified with cataclysmic events, science, and building measures Information, stocks and markets Information, phone calling designs, weblog click streams, program execution arrangements, DNA successions, and quality articulation and structures Information are a few instances of grouping information.
Given an example p, the backing of the arrangement design p is the number of groupings in the information base containing the example p. An example with help more prominent than the help limit min_sup is known as a regular example or an incessant consecutive example. A consecutive example of length l is called an l-design. Successive example mining is the assignment of finding the total arrangement of regular aftereffects given a lot of groupings. Countless conceivable consecutive examples are covered up in information bases.
A consecutive example mining calculation ought to:
a) locate the total arrangement of examples, whenever the situation allows, fulfilling the base support (frequency) limit,
b) be profoundly productive, versatile, including just a few information base outputs,
c) have the option to fuse different sorts of explicit client limitations.