Mining minimal constrained flow cycles from complex transaction data

作者: Michael Bain , Meng Xu

DOI:

关键词: Computer scienceDatabaseDatabase transactionTransaction dataData stream miningCorrectnessData miningScheduling (computing)Distributed transactionOnline transaction processingSearch algorithm

摘要: Transaction data in domains such as trading records from online financial or other markets, logistics delivery registers, and many others, are being accumulated at an increasing rate. In this type of each transaction has a complex format, usually associated with attributes time, numerical quantity, parties involved, so on. Performing mining on trace record transactions may enable the extraction knowledge about implicit relationships which will benefit community different ways, for example by improving market efficiency oversight, detecting scheduling bottlenecks. However, size sets is enormous, therefore order to perform searching techniques considerations often more important than correctness. paper we develop framework embed methods speed up search algorithms goal cycles that fit given constraint predicate amount quantities can flow direction. The method shown improve significantly naive approach, suggests number directions further work.

参考文章(9)
Albert-László Barabási, Réka Albert, Emergence of Scaling in Random Networks Science. ,vol. 286, pp. 509- 512 ,(1999) , 10.1126/SCIENCE.286.5439.509
Girish Keshav Palshikar, Manoj M. Apte, Collusion set detection using graph clustering Data Mining and Knowledge Discovery. ,vol. 16, pp. 135- 164 ,(2008) , 10.1007/S10618-007-0076-8
Takeo Yamada, Harunobu Kinoshita, Finding all the negative cycles in a directed graph Discrete Applied Mathematics. ,vol. 118, pp. 279- 291 ,(2002) , 10.1016/S0166-218X(01)00201-3
Deepayan Chakrabarti, Christos Faloutsos, Graph mining ACM Computing Surveys. ,vol. 38, pp. 2- ,(2006) , 10.1145/1132952.1132954
James C. Tiernan, An efficient search algorithm to find the elementary circuits of a graph Communications of The ACM. ,vol. 13, pp. 722- 726 ,(1970) , 10.1145/362814.362819
Kenichi Yoshida, Hiroshi Motoda, Nitin Indurkhya, Graph-based induction as a unified learning framework Applied Intelligence. ,vol. 4, pp. 297- 316 ,(1994) , 10.1007/BF00872095
Luc Dehaspe, Hannu Toivonen, Discovery of frequent DATALOG patterns Data Mining and Knowledge Discovery. ,vol. 3, pp. 7- 36 ,(1999) , 10.1023/A:1009863704807
D. J. Cook, L. B. Holder, Substructure discovery using minimum description length and background knowledge Journal of Artificial Intelligence Research. ,vol. 1, pp. 231- 255 ,(1993) , 10.1613/JAIR.43
Takashi Washio, Hiroshi Motoda, State of the art of graph-based data mining Sigkdd Explorations. ,vol. 5, pp. 59- 68 ,(2003) , 10.1145/959242.959249