Code Monkey home page Code Monkey logo

Comments (5)

skadio avatar skadio commented on August 17, 2024 1

Great video -- thank you for sharing!

The short answer is no, not out of the box, since the library consider sequences with singleton items (as opposed to a tuple like (A1, A2, B) being an item).

Some data transformation might be possible during pre-processing to feed the input accordingly, OR, dropping the tuples to check if, in your example, A1, A2, A still shows up as frequent at the end.

That said, under the hood for the MDD propagation, there are great parallels with the PrefixSpan algorithm like the pseudo-projection etc.

from seq2pat.

skadio avatar skadio commented on August 17, 2024

The short answer is no, the software is independent of the definition of an item.

If the item of interest is a tuple as in <A1,A2,B>, then you can transform the data to map them, say to X. Likewise, <A,D> to represent another item Y. Then, the event sequence of tuples [["A1", "A2", "B"], ["A", "D"]] becomes [X, Y].

In essence, what we call "items" does not really matter (it can be single items, or tuples) and is not an off-the-shelf transformation within the library, we leave that definition to the specific application.

from seq2pat.

galimba39 avatar galimba39 commented on August 17, 2024

Actually I was interested in investigating the relation within each single tuple element, such as A1 -> D but I think this is not the expected usage.
Thank you for your answer and your work!

from seq2pat.

skadio avatar skadio commented on August 17, 2024

I see, makes sense. If there is a sequence relationship "within" the tuple, may be it is not a static tuple then? As in, items should remain as A1, A2, B and the sequence becomes A1 -> A2 -> B whereby you would have "two" sequences in your first row in the example [["A1", "A2", "B"], ["A", "D"]] --> ["A1", "A2", "B"] as one sequence and ["A", "D"] as another sequence. Just an idea.

Thanks for the positive feedback!

from seq2pat.

galimba39 avatar galimba39 commented on August 17, 2024

I guess yes, tuple size is definitely not static.
My question was trying to address whether this algorithm was fitting the use case of PrefixSpan, such as, in this case

["A1", "A2", "B"], ["A", "D"]

evaluating independently single element A1, A2 and B implying A or D and eventually subsets of tuples, e.g. {A1,A2} -> {A}
I attached here this video to explain better the scenario.

from seq2pat.

Related Issues (20)

Recommend Projects

  • React photo React

    A declarative, efficient, and flexible JavaScript library for building user interfaces.

  • Vue.js photo Vue.js

    🖖 Vue.js is a progressive, incrementally-adoptable JavaScript framework for building UI on the web.

  • Typescript photo Typescript

    TypeScript is a superset of JavaScript that compiles to clean JavaScript output.

  • TensorFlow photo TensorFlow

    An Open Source Machine Learning Framework for Everyone

  • Django photo Django

    The Web framework for perfectionists with deadlines.

  • D3 photo D3

    Bring data to life with SVG, Canvas and HTML. 📊📈🎉

Recommend Topics

  • javascript

    JavaScript (JS) is a lightweight interpreted programming language with first-class functions.

  • web

    Some thing interesting about web. New door for the world.

  • server

    A server is a program made to process requests and deliver data to clients.

  • Machine learning

    Machine learning is a way of modeling and interpreting data that allows a piece of software to respond intelligently.

  • Game

    Some thing interesting about game, make everyone happy.

Recommend Org

  • Facebook photo Facebook

    We are working to build community through open source technology. NB: members must have two-factor auth.

  • Microsoft photo Microsoft

    Open source projects and samples from Microsoft.

  • Google photo Google

    Google ❤️ Open Source for everyone.

  • D3 photo D3

    Data-Driven Documents codes.