Research on properties of level space in the level wise search algorithm

Authors:
Zhang Xiaogang;Chen Hua;Zhang Jing
Affiliations:
College of Electric and Information Engineering;Computer and Communication Institute, Hunan University;College of Electric and Information Engineering
Venue:
FSKD'09 Proceedings of the 6th international conference on Fuzzy systems and knowledge discovery - Volume 1
Year:
2009

Citing 4
Cited 0

Data mining, hypergraph transversals, and machine learning (extended abstract)

PODS '97 Proceedings of the sixteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Levelwise Search and Borders of Theories in KnowledgeDiscovery

Data Mining and Knowledge Discovery
Data Mining: An Overview from a Database Perspective

IEEE Transactions on Knowledge and Data Engineering
Data mining in soft computing framework: a survey

IEEE Transactions on Neural Networks

Quantified Score

Hi-index	0.00

Visualization

Abstract

The level space theory based on the partial order is present from the level wise search algorithm to construct a theoretical frame. Several properties of the level space are drawn and proved in this paper. The present concept of border and transversal can be looked as a property of level space.