Учење правилом асоцијације (Serbian Wikipedia)

Analysis of information sources in references of the Wikipedia article "Учење правилом асоцијације" in Serbian language version.

refsWebsite

Global rank Serbian rank

2^nd place

4^th place

2semanticscholar.org

11^th place

23^rd place

1,266^th place

525^th place

6^th place

5^th place

8,671^st place

7,558^th place

2,066^th place

4,060^th place

70^th place

161^st place

1washington.edu

1,067^th place

757^th place

low place

low place

1dssresources.com

low place

low place

archive.org

Hájek, Petr; Feglar, Tomas; Rauch, Jan; and Coufal, David; The GUHA method, data preprocessing and mining, Database Support for Data Mining Applications. Database Support for Data Mining Applications: Discovering Knowledge with Inductive Queries. Springer. 2004. ISBN 978-3-540-22479-2.

cas.cz

cs.cas.cz

Hájek, Petr (1978). Mechanizing Hypothesis Formation: Mathematical Foundations for a General Theory. and Havránek, Tomáš. Springer-Verlag. ISBN 978-3-540-08738-0.

doi.org

Agrawal, R.; Imieliński, T.; Swami, A. (1993). „Mining association rules between sets of items in large databases”. Proceedings of the 1993 ACM SIGMOD international conference on Management of data - SIGMOD '93. стр. 207. ISBN 978-0-89791-592-2. doi:10.1145/170035.170072.
Hipp, J.; Güntzer, U.; Nakhaeizadeh, G. (2000). „Algorithms for association rule mining --- a general survey and comparison”. ACM SIGKDD Explorations Newsletter. 2: 58—64. S2CID 9248096. doi:10.1145/360402.360421.
Bayardo, Roberto J., Jr.; Agrawal, Rakesh; Gunopulos, Dimitrios (2000). „Constraint-based rule mining in large, dense databases”. Data Mining and Knowledge Discovery. 4 (2): 217—240. S2CID 5120441. doi:10.1023/A:1009895914772.
Wong, Andrew K.C. (1997). Wang, Yang. „High-order pattern discovery from discrete-valued data”. IEEE Transactions on Knowledge and Data Engineering (TKDE). 9 (6): 877—893. doi:10.1109/69.649314.

dssresources.com

„DSS News”. 3 (23).

loc.gov

webarchive.loc.gov

Webb, Geoffrey I. (1995); OPUS: An Efficient Admissible Algorithm for Unordered Search, Journal of Artificial Intelligence Research 3, Menlo Park, CA: AAAI Press, pp. 431-465 „online access”. Архивирано из оригинала 18. 11. 2001. г. Приступљено 01. 06. 2013.

metapress.com

springerlink.metapress.com

Webb, Geoffrey I. (2007); Discovering Significant Patterns, Machine Learning 68(1), Netherlands: Springer, pp. 1-33 online access^{[мртва веза]}

monash.edu

csse.monash.edu

Webb, Geoffrey I. (2000); Efficient Search for Association Rules, in Ramakrishnan, Raghu; and Stolfo, Sal; eds.; Proceedings of the Sixth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD-2000), Boston, MA, New York, NY: The Association for Computing Machinery, pp. 99-107 online access

semanticscholar.org

api.semanticscholar.org

Hipp, J.; Güntzer, U.; Nakhaeizadeh, G. (2000). „Algorithms for association rule mining --- a general survey and comparison”. ACM SIGKDD Explorations Newsletter. 2: 58—64. S2CID 9248096. doi:10.1145/360402.360421.
Bayardo, Roberto J., Jr.; Agrawal, Rakesh; Gunopulos, Dimitrios (2000). „Constraint-based rule mining in large, dense databases”. Data Mining and Knowledge Discovery. 4 (2): 217—240. S2CID 5120441. doi:10.1023/A:1009895914772.

umn.edu

www-users.cs.umn.edu

Tan, Pang-Ning; Michael, Steinbach; Kumar, Vipin (2005). „Chapter 6. Association Analysis: Basic Concepts and Algorithms” (PDF). Introduction to Data Mining. Addison-Wesley. ISBN 978-0-321-32136-7.

washington.edu

cs.washington.edu

Webb, Geoffrey I. (1995); OPUS: An Efficient Admissible Algorithm for Unordered Search, Journal of Artificial Intelligence Research 3, Menlo Park, CA: AAAI Press, pp. 431-465 „online access”. Архивирано из оригинала 18. 11. 2001. г. Приступљено 01. 06. 2013.