Search the World's Largest Database of Information Science & Technology Terms & Definitions
InfInfoScipedia LogoScipedia
A Free Service of IGI Global Publishing House
Below please find a list of definitions for the term that
you selected from multiple scholarly research resources.

What is Succinct Constraint

Chapter 10
Encyclopedia of Data Science and Machine Learning
A constraint C such that all itemsets satisfying C can be expressed in terms of powersets of a fixed number of succinct sets using the set union and/or set difference operators. A succinct set is an itemset, in which items are selected from the domain using the usual Structured Query Language (SQL) selection operator. In simple terms, a constraint C is succinct meaning that all and only those itemsets satisfying C can be explicitly and precisely generated using some precise “formula.”
Published in Chapter:
Big Data Mining and Analytics With MapReduce
Carson K. Leung (University of Manitoba, Canada)
Copyright: © 2023 |Pages: 17
DOI: 10.4018/978-1-7998-9220-5.ch010
Abstract
Big data and machine learning are driving Industry 4.0. In the current era of big data, numerous rich data sources are generating huge volumes of a wide variety of valuable data at a high velocity. Embedded in these big data are implicit, previously unknown, and potentially useful information and knowledge. This calls for data science, which makes good use of big data mining and analytics, machine learning, and related techniques to mine, analyze, and learn from the data to discover hidden gems. This may maximize the citizens' wealth and/or promote all society's health. As an important big data mining and analytics task, frequent pattern mining aims to discover interesting knowledge in the forms of frequently occurring sets of merchandise items or events. To mine them in a scalable manner, several algorithms have used the MapReduce model. This encyclopedia article focuses on MapReduce-based frequent pattern mining from big data.
Full Text Chapter Download: US $37.50 Add to Cart
More Results
Chapter 30
Big Data Analysis and Mining
A constraint C such that all itemsets satisfying C can be expressed in terms of powersets of a fixed number of succinct sets using the set union and/or set difference operators. A succinct set is an itemset, in which items are selected from the domain using the usual SQL selection operator. In simple terms, a constraint C is succinct meaning that all and only those itemsets satisfying C can be explicitly and precisely generated using some precise “formula”.
Published in Chapter: Big Data Analysis and Mining; From: Encyclopedia of Information Science and Technology, Fourth Edition
Full Text Chapter Download: US $37.50 Add to Cart
Chapter 125
Big Data Analytics and Mining for Knowledge Discovery
A constraint C such that all itemsets satisfying C can be expressed in terms of powersets of a fixed number of succinct sets using the set union and/or set difference operators. A succinct set is an itemset, in which items are selected from the domain using the usual Structured Query Language (SQL) selection operator. In simple terms, a constraint C is succinct meaning that all and only those itemsets satisfying C can be explicitly and precisely generated using some precise “formula”.
Published in Chapter: Big Data Analytics and Mining for Knowledge Discovery; From: Encyclopedia of Organizational Knowledge, Administration, and Technology
Full Text Chapter Download: US $37.50 Add to Cart
eContent Pro Discount Banner
InfoSci OnDemandECP Editorial ServicesAGOSR