What is the time and space complexity of fuzzy c-means? Of SOM? How do these complexities compare to those of K-means?
What will be an ideal response?
The time complexity of K-means O(I ? K ? m ? n), where I is the number
of iterations required for convergence, K is the number of clusters, m is the
number of points, and n is the number of attributes. The time required by
fuzzy c-means is basically the same as K-means, although the constant is
much higher. The time complexity of SOM is also basically the same as K-
means because it consists of multiple passes in which objects are assigned to
centroids and the centroids are updated. However, because the surrounding
centroids are also updated and the number of passes can be large, SOM will
typically be slower than K-means.
You might also like to view...
________ view is the main view in OpenOffice Impress that is used to create a presentation
Fill in the blank(s) with correct word
Press RETURN in all of the following circumstances EXCEPT _____.
A. to insert a blank line into a document B. when the insertion point reaches the right margin C. to begin a new paragraph D. in response to prompts in Word dialog
The variables in the method declaration that accept the values from the actual parameters are the ____ parameters.
A. signature B. actual C. formal D. recognized
How do virtual COM ports communicate with the host machine on Hyper-V?
A. COM ports communicate via special TCP/IP enabled network adapters on the guest and the host. B. The serial ports must utilize a special Microsoft USB driver that passes the traffic on the host's USB bus. C. Communication occurs through a setting in the Windows registry. D. Communication is done through the use of a named pipe.