4 ms·
>> clustering does scale I was reading Lin & Wu [1] today; have a look in there for this bit: to create 3000 clusters among 20 million phrases using 3-word wi
by YeGoblynQueenne 11y ago
>> clustering does scale
I was reading Lin & Wu [1] today; have a look in there for this bit:
to create 3000 clusters among 20 million phrases using 3-word windows, each K-Means iteration takes about 20 minutes on 1000 CPUs. Without using the indexing technique in Section 2.4, each iteration takes about 4 times as long.
So, sure, clustering scales... if you have a um, cluster, of 1000 CPUs lying around to spread it over.
You're saying something fundamentally wrong here. There are classically efficient algorithms (linear and sub-linear in time) for first order logic with search, as in unification, RETE etc, whereas all the machine learning algorithms are typically starting at quadratic times and then increase in crazy, mad, insane rates of complexity that would never be accepted in any other field.
It's machine learning that "doesn't scale", not logic.
[1] http://www.aclweb.org/anthology/P09-1116 http://www.aclweb.org/anthology/P09-1116