Involving Aggregate Functions in Multi-relational Search.
PKDD '02: Proceedings of the 6th European Conference on Principles of Data Mining and Knowledge Discovery(2002)
摘要
The fact that data is scattered over many tables causes many problems in the practice of data mining. To deal with this problem, one either constructs a single table by propositionalisation, or uses a Multi-Relational Data Mining algorithm. In either case, one has to deal with the non-determinacy of one-to-many relationships. In propositionali-sation, aggregate functions have already proven to be powerful tools to handle this non-determinacy. In this paper we show how aggregate functions can be incorporated in the dynamic construction of patterns of Multi-Relational Data Mining
更多查看译文
关键词
aggregate function,Multi-Relational Data Mining,Multi-Relational Data Mining algorithm,data mining,dynamic construction,one-to-many relationship,powerful tool,single table,Involving Aggregate Functions,Multi-relational Search
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要