“…According to the definitions of frequent sets and association rules, we can find the solution formulas of the number U of nonempty frequent item sets and the number V of association rules, where x represents the number of items. e number of items in Table 3 (1) from apyori import apriori (2) demand � [["a1," "a2," a3," "b1," "c2," "c3"], ["a2," "a5," "b3," "c1," "c2," "c3"], ["a1," "a5," "b3," "b5," "c2," "c3"], ["a1," "a5," "b1", "b5," "c1"]] (4) relations � apriori(demand, min_support � 0.2, min_confidence � 0.3) (5) for relation in relations: (6) support � round(relation.support, 3) (7) for regulation in relation.ordered_statistics: (8) front � list(regulation.items_base) (9) back � list(regulation.items_add) (10) if front � � []: (11) continue (12) related_list � str(front)+"⟶"+str(back) (13) confidence � round(regulation.confidence, 3) ( 14) lift � round(regulation.lift, 3) (15) print(related_list, support, confidence, lift) ALGORITHM 2: Innovation intention analysis model coding operation simulation. ["c2," "c3," "b3," "a5," "a2"] ⟶ ["c1"] 0.25 1 2 1896…”