Comments (14)
Well, thank you for your attention, I will add these features.
But currently I am busy finishing my paper work, as the deadline is coming soon. Thus I plan to handle your issue soon in early February. I promise that I will consider all the features you submitted.
from gbolt.
Hi Jokeren,
Sure no problem. I will wait for the modified code.
Thanks a lot for your quick response and help :)
On Jan 21, 2016 21:13, "Keren Zhou" [email protected] wrote:
Well, thank you for your attention, I will add these features.
But currently I am busy finishing my paper work, and the deadline is
coming soon. Thus I plan to handle your issue soon in early February. I
promise that I will consider all the features you submitted.—
Reply to this email directly or view it on GitHub
#11 (comment)
.
from gbolt.
Hi Jokeren,
In my earlier post I requested two changes:-
- include the graph ids along with each sub-graph in the final output
- write the output to a separate file.
Every sub-graph present in the final output will always have exactly one
lexicographic parent sub-graph from which the current sub-graph is obtained.
For example, current output has below details:-
t # 3 * 75
v 0 9
v 1 9
v 2 9
e 0 1 0
e 1 2 0
The lexicographic parent sub-graph from which above sub-graph is derived
will be
t # 1 * 80
v 0 9
v 1 9
e 0 1 0
So, if feasible for you, could you please also include the Id of the parent
sub-graph along with the other details for each sub-graph in final output?
Also, can you please give this third change along with previous two changes
?
Appreciate your help in advance.
On Thu, Jan 21, 2016 at 9:57 PM, parnika paranjape <
[email protected]> wrote:
Hi Jokeren,
Sure no problem. I will wait for the modified code.
Thanks a lot for your quick response and help :)
On Jan 21, 2016 21:13, "Keren Zhou" [email protected] wrote:Well, thank you for your attention, I will add these features.
But currently I am busy finishing my paper work, and the deadline is
coming soon. Thus I plan to handle your issue soon in early February. I
promise that I will consider all the features you submitted.—
Reply to this email directly or view it on GitHub
#11 (comment)
.
Regards
Parnika Paranjape
from gbolt.
Hi Jokeren,
Just a gentle reminder.
Can you please take a look at my previous post and help me with the listed issues at the earliest?
Appreciate your help in advance.
from gbolt.
@parnika26 Hi, I have just finished my paper. Thank you for reminding. Tomorrow is Chinese New Year Festival, and I also wish you good luck!
from gbolt.
Hi Keren,
Thanks a lot for your quick response.
Wish you a Happy New and prosperous year.
Please let me know when you are done with the changes.
Sorry for the trouble but I need to use those changes in my research work.
Hence, waiting on you :)
Good luck for your paper :)
Appreciate your help in advance.
On Feb 6, 2016 17:06, "Keren Zhou" [email protected] wrote:
@parnika26 https://github.com/parnika26 Hi, I have just finished my
paper. Thank you for reminding. Tomorrow is Chinese New Year Festival, and
I also wish you good luck!—
Reply to this email directly or view it on GitHub
#11 (comment)
.
from gbolt.
I plan to deal with them from tomorrow on, don't worry. :)
from gbolt.
Hi Keren,
Thank you so much :)
On Feb 6, 2016 18:54, "Keren Zhou" [email protected] wrote:
I plan to deal with them from tomorrow on, don't worry. :)
—
Reply to this email directly or view it on GitHub
#11 (comment)
.
from gbolt.
Please checkout the refine branch, including first two features.
https://github.com/Jokeren/DataMining-gSpan/tree/refine
from gbolt.
Hi Keren,
Thanks a lot for the help so far.
I have downloaded the modified code and tried running it. It runs fine.
But I see that the output is written to multiples files [For
ex,Chemical_3400, Chemical_3401, Chemical_3402, Chemical_3403] . Also, the
sub-graphs in these output files are currently written as follows:-
t # 3 * 75
parent graphs:
40 42 46 47 50 51 53 57 58 68 96 102 103 120 141 147 149 150 151 153
163 165 166 171 173 176 177 178 185 186 187 190 192 193 206 208 210
215 221 226 238 297 302 308 337
v 0 9
v 1 9
v 2 9
e 0 1 0
e 1 2 0
Could you please make below changes in the code?
-
Write output to a single file instead of multiple files.
-
Write each sub-graph in below format [Old label 'parent graphs' , new
label 'x'. List of graph Ids at the end after writing edges]
t # 3 * 75
v 0 9
v 1 9
v 2 9
e 0 1 0
e 1 2 0
x: 40 42 46 47 50 51 53 57 58 68 96 102 103 120 141 147 149 150 151 153
163 165 166 171 173 176 177 178 185 186 187 190 192 193 206 208 210
215 221 226 238 297 302 308 337
- As mentioned in earlier post, include the Id of the lexicographic parent
sub-graph along with the other details for each sub-graph in final output.
The lexicographic parent sub-graph from which above sub-graph is generated
will be,
t # 1 * 80
v 0 9
v 1 9
e 0 1 0
x:
After including parent id, each sub-graph written to output will then
appear in below format,
t # 3 * 75
parent id: 1
v 0 9
v 1 9
v 2 9
e 0 1 0
e 1 2 0
x: 40 42 46 47 50 51 53 57 58 68 96 102 103 120 141 147 149 150 151
153 163 165 166 171 173 176 177 178 185 186 187 190 192 193 206 208
210 215 221 226 238 297 302 308 337
Appreciate your help in advance.
On Sun, Feb 7, 2016 at 12:40 PM, Keren Zhou [email protected]
wrote:
Please checkout the refine branch, including first two features.
https://github.com/Jokeren/DataMining-gSpan/tree/refine—
Reply to this email directly or view it on GitHub
#11 (comment)
.
Regards
Parnika Paranjape
from gbolt.
Check out first two features.
I have to modify plenty of codes for the third feature, so it is currently in progress.
from gbolt.
Hi Keren,
Thanks a lot for the changes.
I have checked first two features and they are fine.
Just a small change.
Instead of writing graph ids on the new line after label 'x:' , can you
please write them on the same line as shown below ?
x 12 26 36 42 52 62 63 64 72 86 92 96 104 112 123 154 162 166 174 181 192
210 221 236 243 252 259 265 270 273 278 282 289 294 307 329
But I am in no hurry for this change. So, even if you give this change
along with the changes for third feature I am okay with it.
Thank you so much Keren :)
On Tue, Feb 9, 2016 at 8:37 AM, Keren Zhou [email protected] wrote:
Check out first two features.
I have to modify plenty of codes for the third feature, so it is currently
in progress.—
Reply to this email directly or view it on GitHub
#11 (comment)
.
Regards
Parnika Paranjape
from gbolt.
parent graph id updated @parnika26
from gbolt.
Hi Keren,
I have downloaded the modified code and tried running it.
It runs fine and gives desired output.
Thank you so much for the help so far :)
It was nice working with you.
In future, if I need some help I will get back to you :)
Once again thanks a lot.
On Wed, Feb 10, 2016 at 9:01 AM, Keren Zhou [email protected]
wrote:
parent graph id updated @parnika26 https://github.com/parnika26
—
Reply to this email directly or view it on GitHub
#11 (comment)
.
Regards
Parnika Paranjape
from gbolt.
Related Issues (19)
- &> log HOT 1
- can't compile main.cc HOT 2
- data properties HOT 16
- windows7 32bits HOT 1
- Program terminates abnormally for certain frequency threshold HOT 29
- Split thread error HOT 5
- directed graph support HOT 3
- Print Id of the subgraph from which the given subgraph is obtained through single edge extension in the output HOT 19
- Regarding citing this tool HOT 6
- About the source code HOT 12
- Do vertices need to be sequentially ordered in input file? (possible bug) HOT 5
- Does gbolt support input files larger than 5GB? HOT 9
- The Problem of Unable to Mining Frequent Subgraphs of Large Graphs HOT 3
- Error while trying to install gbolt HOT 5
- Error while trying to run gbolt HOT 9
- Implement CloseGraph HOT 1
- Incorrect(?) output for test data HOT 5
- Does gBolt support directed graph mining?
Recommend Projects
-
React
A declarative, efficient, and flexible JavaScript library for building user interfaces.
-
Vue.js
🖖 Vue.js is a progressive, incrementally-adoptable JavaScript framework for building UI on the web.
-
Typescript
TypeScript is a superset of JavaScript that compiles to clean JavaScript output.
-
TensorFlow
An Open Source Machine Learning Framework for Everyone
-
Django
The Web framework for perfectionists with deadlines.
-
Laravel
A PHP framework for web artisans
-
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.
-
Visualization
Some thing interesting about visualization, use data art
-
Game
Some thing interesting about game, make everyone happy.
Recommend Org
-
Facebook
We are working to build community through open source technology. NB: members must have two-factor auth.
-
Microsoft
Open source projects and samples from Microsoft.
-
Google
Google ❤️ Open Source for everyone.
-
Alibaba
Alibaba Open Source for everyone
-
D3
Data-Driven Documents codes.
-
Tencent
China tencent open source team.
from gbolt.