An Algorithm Mining Frequent Item Set and their Related Transaction Set(TS) 频繁项目集及相关事务集(TS)的挖掘算法
Critical transaction set and task authorization indicator are introduced to allow for finer granular permission control, thus some problems of complex constrains such as history-based separation of duty can be solved effectively, and this provide a good base for active access control. 通过引入临界事务集(TS)合和任务授权指示符,实现了细粒度的权限控制,能够较好地解决基于历史的职责分离之类的复杂约束问题,并为主动访问控制奠定了基础。
Based on schedulability analysis, this paper also presents the conditions of feasible transaction scheduling for given real-time transaction set, and an integer programming model for constructing optimal scheduling, which is of benefit to the whole optimization of scheduling. 进一步由此建立了实时事务的静态可调度性分析模型以及求最优可行调度的整数规划模型,该模型有利于达到实时事务调度的整体优化。
Traditional algorithms mining association rules can not find the Transaction Set(TS) ( TS ) in which Frequent Item Set ( FIS ) appears. However, a FIS only caused by one or few customers is meaningless. 发现频繁项目集所关联的事务集(TS)是十分有意义的,它能使人们了解频繁项目集是由哪些顾客的购买行为所引起的。
A business transaction is set up by building a directory structure ( tree ), using these correlators. 事务可以用这些correlator建立目录结构或者树结构。