Evaluating cluster preservation in frequent itemset integration for distributed databases.
Medical sciences are rapidly emerging as a data rich discipline where the amount of databases and their dimensionality increases exponentially with time. Data integration algorithms often rely upon discovering embedded, useful, and novel relationships between feature attributes that describe the data. Such algorithms require data integration prior to knowledge discovery, which can lack the timeliness, scalability, robustness, and reliability of discovered knowledge. Knowledge integration algorithms offer pattern discovery on segmented and distributed databases but require sophisticated methods for pattern merging and evaluating integration quality. We propose a unique computational framework for discovering and integrating frequent sets of features from distributed databases and then exploiting them for unsupervised learning from the integrated space. Assorted indices of cluster quality are used to assess the accuracy of knowledge merging. The approach preserves significant cluster quality under various cluster distributions and noise conditions. Exhaustive experimentation is performed to further evaluate the scalability and robustness of the proposed methodology.
Dua
Sumeet
S
Department of Computer Science, Louisiana Tech University, Ruston, LA 71272, USA. Sdua@latech.edu
Dessauer
Michael P
MP
Sethi
Prerna
P
D000465:Algorithms; D016000:Cluster Analysis; D003195:Computer Communication Networks; D057225:Data Mining / Q000706:statistics & numerical data*; D016208:Databases, Factual / Q000706:statistics & numerical data*; D013223:Statistics as Topic; D057170:Translational Research, Biomedical