Beefy Boxes and Bandwidth Generously Provided by pair Networks
No such thing as a small change

Re: Searching for information about Granular Computing with Perl

by jkeenan1 (Deacon)
on Sep 25, 2006 at 01:01 UTC ( #574637=note: print w/replies, xml ) Need Help??

in reply to Searching for information about Granular Computing with Perl

1. Googling for 'granular computing Perl' didn't turn up anything obviously pertinent, so I guess you're as welcome as anyone to introduce granular computing to the Perl community (or at least to the monastery).

2. The posting on your scratchpad would be a bit more useful if, instead of expecting to get the data via a handle to a file, you were to supply us with a dozen or so lines of sample data under a __DATA__ tag at the end of the script.

Jim Keenan

Replies are listed 'Best First'.
Re^2: Searching for information about Granular Computing with Perl
by lin0 (Curate) on Sep 25, 2006 at 02:10 UTC

    Hi Jim,

    Thank you for your comments.

    About your first comment, do you mean that I should write a small tutorial about Granular Computing to introduce it to our fellow Monks? Or do you simply mean that I should keep writing the code and ask for feedback from our community? For the former case, I could certainly start by describing what the Fuzzy C-means does and how it can be used in Granular Computing. It will take me a couple of weeks, though, because I am quite busy right now with other stuff. However, to give you a preview, I can tell you that what the Fuzzy C-Means does is to look for groups in the data (that is, it groups patterns according to their similarity. This is why, some people say that the Fuzzy C-means searches for structure in the data). For the latter case, that is what I am doing: porting my code to Perl. When I get more code written, I will certainly post it on the Monastery to ask for feedback.

    About your second comment, I just posted some sample data as you suggested. It is a very simple dataset. If you want to play with it, what I suggest you do is the following:

    1. Plot the data using your favourite program. I suggest you use an XY chart. On this chart, you might notice that there are two groups of patterns: one close to (0, 0) and the other close to (12, 10)
    2. Run the code available in the lin0's scratchpad without any argument (without arguments it will search for two groups). One of the groups will have a prototype (sort of representative element) about (1.0, 0.9) while the second one will have a prototype about (11.5, 11.2)

    I really was not expecting to discuss much about the code but if people are interested, I could certainly write a node describing it in more detail.

    Thanks again,


      "About your first comment, do you mean that I should write a small tutorial about Granular Computing to introduce it to our fellow Monks?"

      I can't speak for Jim, but I personally would welcome a short introductory tutorial, with short introductory examples in perl.

      Is the Wikipedia entry on Granular Computing accurate?

        Hi jgamble,

        Thank you for your comments. I will prepare a short introductory tutorial to Granular Computing some time in the next two weeks. I will post it under Meditations. I will certainly add some examples. However, do not expect a full application written in Perl because I just started the process of porting all my code to Perl. This is why I wrote the post in the first place ;-)

        About the accuracy of the Granular Computing entry in the Wikipedia, well, there is room for improvement. What I could do is once I finish the introductory tutorial for the PerlMonks, I could certainly add it to the Wikipedia entry

        Thanks again,


Log In?

What's my password?
Create A New User
Node Status?
node history
Node Type: note [id://574637]
and the monks are chillaxin'...

How do I use this? | Other CB clients
Other Users?
Others contemplating the Monastery: (7)
As of 2018-02-21 05:58 GMT
Find Nodes?
    Voting Booth?
    When it is dark outside I am happiest to see ...

    Results (275 votes). Check out past polls.