@inproceedings{garg_pbirch_2006,
	title = {{PBIRCH}: {A} {Scalable} {Parallel} {Clustering} algorithm for {Incremental} {Data}},
	shorttitle = {{PBIRCH}},
	doi = {10.1109/IDEAS.2006.36},
	abstract = {We present a parallel version of BIRCH with the objective of enhancing the scalability without compromising on the quality of clustering. The incoming data is distributed in a cyclic manner (or block cyclic manner if the data is bursty) to balance the load among processors. The algorithm is implemented on a message passing share-nothing model. Experiments show that for very large data sets the algorithm scales nearly linearly with the increasing number of processors. Experiments also show that clusters obtained by PBIRCH are comparable to those obtained using BIRCH},
	booktitle = {2006 10th {International} {Database} {Engineering} and {Applications} {Symposium} ({IDEAS}'06)},
	author = {Garg, Ashwani and Mangla, Ashish and Gupta, Neelima and Bhatnagar, Vasudha},
	month = dec,
	year = {2006},
	note = {ISSN: 1098-8068},
	keywords = {Algorithm design and analysis, Broadcasting, Clustering algorithms, Computer science, Delay, Memory management, Message passing, Partitioning algorithms, Scalability, Time factors},
	pages = {315--316},
}

{"_id":"ypBmktTPwKrSrPQ3v","bibbaseid":"garg-mangla-gupta-bhatnagar-pbirchascalableparallelclusteringalgorithmforincrementaldata-2006","author_short":["Garg, A.","Mangla, A.","Gupta, N.","Bhatnagar, V."],"bibdata":{"bibtype":"inproceedings","type":"inproceedings","title":"PBIRCH: A Scalable Parallel Clustering algorithm for Incremental Data","shorttitle":"PBIRCH","doi":"10.1109/IDEAS.2006.36","abstract":"We present a parallel version of BIRCH with the objective of enhancing the scalability without compromising on the quality of clustering. The incoming data is distributed in a cyclic manner (or block cyclic manner if the data is bursty) to balance the load among processors. The algorithm is implemented on a message passing share-nothing model. Experiments show that for very large data sets the algorithm scales nearly linearly with the increasing number of processors. Experiments also show that clusters obtained by PBIRCH are comparable to those obtained using BIRCH","booktitle":"2006 10th International Database Engineering and Applications Symposium (IDEAS'06)","author":[{"propositions":[],"lastnames":["Garg"],"firstnames":["Ashwani"],"suffixes":[]},{"propositions":[],"lastnames":["Mangla"],"firstnames":["Ashish"],"suffixes":[]},{"propositions":[],"lastnames":["Gupta"],"firstnames":["Neelima"],"suffixes":[]},{"propositions":[],"lastnames":["Bhatnagar"],"firstnames":["Vasudha"],"suffixes":[]}],"month":"December","year":"2006","note":"ISSN: 1098-8068","keywords":"Algorithm design and analysis, Broadcasting, Clustering algorithms, Computer science, Delay, Memory management, Message passing, Partitioning algorithms, Scalability, Time factors","pages":"315–316","bibtex":"@inproceedings{garg_pbirch_2006,\n\ttitle = {{PBIRCH}: {A} {Scalable} {Parallel} {Clustering} algorithm for {Incremental} {Data}},\n\tshorttitle = {{PBIRCH}},\n\tdoi = {10.1109/IDEAS.2006.36},\n\tabstract = {We present a parallel version of BIRCH with the objective of enhancing the scalability without compromising on the quality of clustering. The incoming data is distributed in a cyclic manner (or block cyclic manner if the data is bursty) to balance the load among processors. The algorithm is implemented on a message passing share-nothing model. Experiments show that for very large data sets the algorithm scales nearly linearly with the increasing number of processors. Experiments also show that clusters obtained by PBIRCH are comparable to those obtained using BIRCH},\n\tbooktitle = {2006 10th {International} {Database} {Engineering} and {Applications} {Symposium} ({IDEAS}'06)},\n\tauthor = {Garg, Ashwani and Mangla, Ashish and Gupta, Neelima and Bhatnagar, Vasudha},\n\tmonth = dec,\n\tyear = {2006},\n\tnote = {ISSN: 1098-8068},\n\tkeywords = {Algorithm design and analysis, Broadcasting, Clustering algorithms, Computer science, Delay, Memory management, Message passing, Partitioning algorithms, Scalability, Time factors},\n\tpages = {315--316},\n}\n\n","author_short":["Garg, A.","Mangla, A.","Gupta, N.","Bhatnagar, V."],"key":"garg_pbirch_2006","id":"garg_pbirch_2006","bibbaseid":"garg-mangla-gupta-bhatnagar-pbirchascalableparallelclusteringalgorithmforincrementaldata-2006","role":"author","urls":{},"keyword":["Algorithm design and analysis","Broadcasting","Clustering algorithms","Computer science","Delay","Memory management","Message passing","Partitioning algorithms","Scalability","Time factors"],"metadata":{"authorlinks":{}}},"bibtype":"inproceedings","biburl":"https://bibbase.org/zotero/mh_lenguyen","dataSources":["iwKepCrWBps7ojhDx"],"keywords":["algorithm design and analysis","broadcasting","clustering algorithms","computer science","delay","memory management","message passing","partitioning algorithms","scalability","time factors"],"search_terms":["pbirch","scalable","parallel","clustering","algorithm","incremental","data","garg","mangla","gupta","bhatnagar"],"title":"PBIRCH: A Scalable Parallel Clustering algorithm for Incremental Data","year":2006}