From post

копировать удалить добавить публикацию в буфер
Запись сообщества
посмотреть историю данной записи
URL
DOI
BibTeX
EndNote
APA
Chicago
DIN 1505
Harvard
MSOffice XML

An Effective Hash Based Algorithm for Mining Association Rules.

J. Park, M. Chen, и P. Yu. SIGMOD Conference, стр. 175-186. ACM Press, (1995)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed.

An Effective Hash Based Algorithm for Mining Association Rules.J. Park, M. Chen, и P. Yu. SIGMOD Conference, стр. 175-186. ACM Press, (1995)Efficient Data Mining for Path Traversal Patterns in Distributed Systems.M. Chen, J. Park, и P. Yu. ICDCS, стр. 385-393. IEEE Computer Society, (1996)Fast Algorithms for Projected Clustering.C. Aggarwal, C. Procopiuc, J. Wolf, P. Yu, и J. Park. SIGMOD Conference, стр. 61-72. ACM Press, (1999)SIGMOD Record 28(2), June 1999.Data mining for path traversal patterns in a web environmentM. Chen, J. Park, и P. Yu. International Conference on Distributed Computing Systems, стр. 385--392. IEEE, (1996)Mining Association Rules with Adjustable Accuracy.J. Park, P. Yu, и M. Chen. CIKM, стр. 151-160. ACM, (1997)Top-k high utility itemset mining based on utility-list structures.S. Lee, и J. Park. BigComp, стр. 101-108. IEEE Computer Society, (2016)Efficient data mining for path traversal patternsM. Chen, J. Park, и P. Yu. IEEE Transactions on knowledge and data engineering, 10 (2): 209--221 (1998)A New Adaptive Sectorization Method to Use Maximum Capacity of Base Station in Wireless Communications.S. Lim, S. Oh, и J. Park. CDMA International Conference, том 2524 из Lecture Notes in Computer Science, стр. 173-182. Springer, (2002)Efficient Parallel and Data Mining for Association Rules.J. Park, M. Chen, и P. Yu. CIKM, стр. 31-36. ACM, (1995)