{"references": ["Agarwal, R. and Srikant, R,\u00d4\u00c7\u00ffFast Algorithms for Mining Association\nRules, Proc. Very Large Database Conf. 1994.", "R.Agarwal. T.Imielinski and A. Swami, Mining Association Rules\nbetween Sets of Items in Large Databases, Proc. ACM International\nConferences on Management of Data, 1993, pp.207-216.", "Cheung, D. Lee, S. and Kao, B., Maintenance of Discovered\nAssociation Rules in Large Databases: An Incremental Updating\nTechnique, Proc. 12th Int-l Conf. Data Eng., 1996, pp. 106-114.", "U.M. Fayyad, G. Piatetsky-Shapiro, P. Smyth, and R. Uthurusamy,\nAdvances in Knowledge Discovery and Data Mining. AAAI Press/The\nMIT Press, 1996.", "Han, J. Pei, J. and Yin, Y. , Mining Frequent Patterns Without Candidate\nGeneration, Proc. ACM SIGMOD Int-l Conf. Management of Data,\n2000, pp. 1-12.", "Jia-Wei Han and Micheline Kamber (2001), Data Mining: Concepts and\nTechniques, Morgan Kaufmann Publishers.", "R.Nedunchezhian and K.Anbumani, Single Scan Frequent set\nGeneration in Association Rule Mining, Proc. 1st International\nComputer Engineering Conference New Technologies for the\nInformation Society, Cairo University, Egypt, 2004, 300-305.", "Park, J.S. Chen, M.S. and Yu, P.S., An Effective Hash Based Algorithm\nfor Mining Association Rules, Proc. ACM SIGMOD Conf. Management\nof Data, 1995.", "Rastogi, R. and Shim, K., Mining Optimized Support Rules for Numeric\nAttributes, Proc. ACM SIGMOD Conf. Management of Data, 1999.\n[10] Simovici, Dan A. Cristofor, Laurentiu and Cristofor, Dana, Galois\nConnections and Data mining, J.UCS: Journal of Universal Computer\nScience, 2000.\n[11] Webb, G.I., Efficient Search for Association Rules, Proc. ACM\nSIGKDD Int-l Conf. Knowledge Discovery and Data Mining, 2000,\npp. 99-107.\n[12] Wu, Xindong and Zhang, Shichao, Synthesizing High- Frequency Rules\nfrom Different Data Sources, IEEE Trans. Knowledge and Data Eng.,\nvol. 15, no.2., Mar/Apr 2003."]}

A big organization may have multiple branches spread across different locations. Processing of data from these branches becomes a huge task when innumerable transactions take place. Also, branches may be reluctant to forward their data for centralized processing but are ready to pass their association rules. Local mining may also generate a large amount of rules. Further, it is not practically possible for all local data sources to be of the same size. A model is proposed for discovering valid rules from different sized data sources where the valid rules are high weighted rules. These rules can be obtained from the high frequency rules generated from each of the data sources. A data source selection procedure is considered in order to efficiently synthesize rules. Support Equalization is another method proposed which focuses on eliminating low frequency rules at the local sites itself thus reducing the rules by a significant amount.