gahag / dci Goto Github PK
View Code? Open in Web Editor NEWDCI-Closed, a frequent closed itemset mining algorithm, implemented in Rust
License: MIT License
DCI-Closed, a frequent closed itemset mining algorithm, implemented in Rust
License: MIT License
I am not familiar with BitMatrix
that is used in this library, if I want to pass a list of transactions from python with PyO3
, would there be too much overhead converting transactions in form of Vec<Vec<i64>>
to the BitMatrix
since I have to set those values one by one.
say I have transaction list that has 100000 rows and 300 unique features
[[25, 14, 22], [8, 23], [8, 1, 10, 27, 0], [12, 26, 6, 7, 18, 2], [2, 21], [1, 13, 27], [25, 24, 11, 8, 22, 27], [0, 21, 23, 28], [21, 7, 11, 26, 16], [24], [19, 3, 2], [6], [5, 18, 0, 1], [11, 9, 17], [12, 14, 5, 17], [11], [], [4, 0], [24, 9, 12], [13, 25, 8, 23], [26, 4], [22, 1], [20], [4, 0], [19, 16, 1, 27, 22, 25], [5, 26], [9, 17, 25], [8, 3, 10], [26, 16, 11], [20, 14, 9, 6], [17, 5, 26, 6], [21], [0, 17], [15, 23, 2], [17, 29, 22, 20, 6, 13], [8, 20, 7, 14, 2, 15, 18, 10, 19, 17], [6, 13], [25, 11, 19], [28, 21, 18, 13, 25, 0, 29, 5, 11], [14, 24], [20, 17, 13, 11], [24], [6, 14], [12, 14], [25, 3, 6, 8], [16, 26, 3, 21], [4, 0, 23, 17, 25], [14, 5, 21, 24, 8], [11, 13, 3], [], [6, 0, 3], [1, 0, 25], [9, 18, 25], [14], [28, 22, 19, 7, 5], [28, 9, 19, 17], [14], [6, 10], [18, 25], [5, 29, 24, 27], [3, 27, 2], [22, 8], [17, 23], [14, 2, 22, 7], [20, 15, 27, 1, 29], [4], [8, 15], [7, 29], [12], [1, 26], [8, 9, 2], [6, 29, 22], [3, 6, 23], [27, 20, 4, 21, 5], [25, 0, 23, 14], [1, 8, 0], [19, 9], [13, 29], [0, 23, 25], [11, 16, 19, 21], [2, 20, 19, 10], [22, 14, 7, 26, 16], [28], [23, 13], [27, 10, 6, 22, 3, 5, 18], [21, 12], [12], [19, 7], [28, 2, 25], [21, 26, 17], [18, 19, 12], [6, 19, 18, 9], [14, 10, 4], [19, 8], [23], [19, 21], [15, 20, 19, 4], [4, 27, 5], [], [20, 8]] ...
I had a hard time mining rules from the transactions I have, it complains pyo3_runtime.PanicException: attempt to shift left with overflow
when I used the ItemSet8
, but when I changed data: u8
to data: u64
, the problem disappears, but I wasn't able to mine any rules.
So my question is:
ItemSet8
(self.data & (1 << self.ix)
), I wonder if this will limit the capability of the algorithm for mining transactions that has more than a certain amount of features?[], 30
ItemSet8
in order to get legitimate rules mined on larger dataset?Thanks a lot!
A declarative, efficient, and flexible JavaScript library for building user interfaces.
๐ Vue.js is a progressive, incrementally-adoptable JavaScript framework for building UI on the web.
TypeScript is a superset of JavaScript that compiles to clean JavaScript output.
An Open Source Machine Learning Framework for Everyone
The Web framework for perfectionists with deadlines.
A PHP framework for web artisans
Bring data to life with SVG, Canvas and HTML. ๐๐๐
JavaScript (JS) is a lightweight interpreted programming language with first-class functions.
Some thing interesting about web. New door for the world.
A server is a program made to process requests and deliver data to clients.
Machine learning is a way of modeling and interpreting data that allows a piece of software to respond intelligently.
Some thing interesting about visualization, use data art
Some thing interesting about game, make everyone happy.
We are working to build community through open source technology. NB: members must have two-factor auth.
Open source projects and samples from Microsoft.
Google โค๏ธ Open Source for everyone.
Alibaba Open Source for everyone
Data-Driven Documents codes.
China tencent open source team.