classification - Indexing with KDB-tree for dimension reduction in Big data stream -
i'm trying find a way reduce dimensions of big data set accurate classification.
recently have came across new structure in computer science called "kdb-tree".
(here complete information of kdb-tree)
briefly, kdb-tree structure subdividing k-dimensional search space provide search efficiency of balanced kd-tree.
this topic important me, because of master thesis's proposal, , i'm not sure using structure kdb-tree (or that) indexing, can me doing big data stream dimension reduction
or
even may kdb-tree structure helpful in preprocessing of data stream classification?
i'm new in data science , i'm not sure idea implementable or not.
Comments
Post a Comment