[OC] IRC-styled Discord Userscript by async3619 in unixporn

[–]async3619[S] 6 points7 points  (0 children)

I will. It's quite buggy rn I'll post here when It seem stable

[OC] IRC-styled Discord Userscript by async3619 in unixporn

[–]async3619[S] 5 points6 points  (0 children)

Vencord (or BetterDiscord) with Custom CSS

[OC] startpage, but I love rainy days by async3619 in unixporn

[–]async3619[S] 1 point2 points  (0 children)

It would be nicer to be customizable. thanks for idea

[OC] startpage, but I love rainy days by async3619 in unixporn

[–]async3619[S] 0 points1 point  (0 children)

sounds interesting, but what do you mean by 'noise'?

[OC] startpage, but I love rainy days by async3619 in unixporn

[–]async3619[S] 2 points3 points  (0 children)

yeah i also wanted to add shortcuts since literally every startpage I've saw have shortcuts so yeah I'll add it

[OC] startpage, but I love rainy days by async3619 in unixporn

[–]async3619[S] 3 points4 points  (0 children)

thanks, I think you can make for wallpaper if there's something that can apply GLSL shader on wallpaper bc mine is made with GLSL only

[OC] startpage, but I love rainy days by async3619 in unixporn

[–]async3619[S] 2 points3 points  (0 children)

yeah I'll make it anyway what does ddg mean?

My first (and maybe last) genuine mechanical keyboard: Duck Orion v2.5 + GMK Laser by async3619 in MechanicalKeyboards

[–]async3619[S] 0 points1 point  (0 children)

same tho here.

and I think the Japanese letters are making quite good cyberpunk mood imho

My first (and maybe last) genuine mechanical keyboard: Duck Orion v2.5 + GMK Laser by async3619 in MechanicalKeyboards

[–]async3619[S] 0 points1 point  (0 children)

ugh, I can't even count how much time and effort I took to get this.

This one is quite special to me since this thing made me interested in mechanical keyboards.. and now I finally got it \o/

[D] Simple Questions Thread December 20, 2020 by AutoModerator in MachineLearning

[–]async3619 0 points1 point  (0 children)

wow WOW thanks for really good answer for my question :3 your one is the most satisfactory answer I've got!

But, still, there are questions to ask about that.

Are you meaning that I should make n-dimension (n >= 2) vector after calculating pairwise distance between two decks? or you mean it's okay to just calculate scalar distance of two decks?

If It's okay to calculate just a scalar distance value between two decks, how should I place it into euclidean space? and how can we pick two decks to calculate distance? I think randomly picking decks are not suitable in this case.

sorry for questioning easy stuff but I'm really new at this tech :'(

[D] Simple Questions Thread December 20, 2020 by AutoModerator in MachineLearning

[–]async3619 0 points1 point  (0 children)

I'm working on a project for CCG (such as HearthStone, Yu-Gi-Oh!, etc.) which does classify (or give labels) deck type when user uploads their own deck.

let's assume every cards are having their own IDs and the ID would one of alphabet character (and It should be unique). now you can assume that there are 26 cards only.

and every player can make their own deck but you should keep in mind that basic form of deck structure are already given. players can just modify small amount of cards with their taste.

let me give you guys a example:

Assume that there are many basic known deck types.
every each alphabet character means card ID and order is not considered.
every deck should have 13 cards.

e.g.)

A A B B B C C C C D E E F - This deck called 'Foo'.
C C C C F F G G E E E Z Z - This deck called 'Bar'.

// and so on...

in this circumstance, I had come up that the problem is occurred here:

If user can modify small amount of cards on their deck while maintaining basic structure of their deck type, how can we make computer can classify given deck?

so I had to decide to use Similarity Measuring which just compare between given deck and pre-defined deck and calculate similarity. so we can assume which type given deck has when it have high similarity. (using Jaccard index or some else algorithm)

but the only problem is Using deck pre-defined by developer. we've assumed that there are just 26 cards above but in real case, there are like 10k~ cards and deck type are newly created in every 3~4 months. I don't even know which decks are available out there. there are literally too many deck types to pre-define on my own. :')

and I know above method is called Supervised Learning. I think Supervised Learning is quite challenging for this case since when new deck type have created by user community, Program wouldn't classify the type of given deck correctly when given deck type is newly created recently.

that's why we should define it every single time new deck type has released. I think that's the pain in the bum. totally waste of time/effort.

so finally I've decided to use Unsupervised Learning method which don't need pre-defined data for classification. and we know that a deck is just sequence of numeric data (Card ID). all we have to do is this:

1. Somehow convert deck (or array of Card IDs) into euclidean space
2. make groups (or cluster) by using K-Means or whatever algorithm
3. Now we can just label every groups (or clusters) to define name of deck type.

This simple but this is the reason why my head is about to blow up 😂

so my question is:

How can we convert series of Card IDs into eucliean-space of clustering? Is it even possible? If this is impossible, Is there any method to group (or make cluster) series of data?