RE: K-means clustering using native functions
"Nunez Robinson, Claudia Isabel" <[email protected]> Fri, 18 Oct 2013 21:21:25 +0000
| Newsgroups | gmane.comp.db.mysql.devel |
|---|---|
| Message-ID | <E7E71F1B925F7E41829D37B440FADA0004029FA3@CITESMBX5.ad.uillinois.edu> |
Thanks for the email Alf.=0A= =0A= You are totally right, there are multiple tools available to perform any ma= chine learning or data mining analysis such as k-means with in many advance= d forms. One of them is weka, which I used recently and is open-sourced. An= d just like weka, there are many others. =0A= =0A= Let's say I would like to perform a k-mean clustering using native function= s mainly for academic purposes. I know there might be a significant negativ= e impact on performance, at least in comparison with in-memory like tools.= =0A= =0A= So, this is why question still remains open. I would like to stick to or di= scard the possibility of implementing a k-mean clustering algorithm using n= ative functions.=0A= =0A= Thanks again for your reply,=0A= =0A= Claudia=0A= =0A= ________________________________________=0A= From: Alf. Hester [[email protected]]=0A= Sent: Thursday, October 17, 2013 12:41 AM=0A= To: [email protected]=0A= Subject: Re: K-means clustering using native functions=0A= =0A= Hi Caludia,=0A= =0A= my experiences with K-Means Clustering shows that it is much faster and=0A= more flexible than a (direct) database approach to perform it in=0A= computer memory.=0A= Usually for the most widely used programming languages still solutions=0A= (more or less modular) exist.=0A= Primarily datas path DB -> K-Means Module has to be done.=0A= =0A= Alf.=0A= =0A= =0A= Am 17.10.2013 07:21, schrieb Nunez Robinson, Claudia Isabel:=0A= > Hi,=0A= >=0A= > I'm new working with the mysql code and have couple of questions I hope t= he members of this mailing list can help me to answer.=0A= >=0A= > I would like to implement a k-mean clustering function in mysql using the= native functions in mysql. In order to assign an element/tuple to a cluste= r, I need to do some pre-computations using all the tuples in a given table= . I know that due to the atomicity property, this is probably very hard to = achieve using native functions.=0A= >=0A= > So, my question is, is it possible to access/read all the tuples in a tab= le from a native function? If the answer is yes, can you point me to a curr= ent function that does this (I haven't found any so far). If the answer is = no, could you recommend another right way of doing this?=0A= >=0A= > Thanks for your kind reply,=0A= >=0A= > Claudia=0A= >=0A= >=0A= >=0A= >=0A= >=0A= >=0A= =0A= =0A= --=0A= MySQL Internals Mailing List=0A= For list archives: http://lists.mysql.com/internals=0A= To unsubscribe: http://lists.mysql.com/internals=0A= =0A= -- MySQL Internals Mailing List For list archives: http://lists.mysql.com/internals To unsubscribe: http://lists.mysql.com/internals