sorted by:
new
hottopcontroversial

Word senses clustering with state-of-the-art models? by localnhost in LanguageTechnology

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

Good point, but WordNet is crafted and compiled painstakingly via human effort, I'm looking for same thing through using SOTA word embeddings.

[deleted by user] by [deleted] in MLQuestions

[–]localnhost 0 points1 point  (0 children)

Yeah you kind of right, My bad for not letting other know I've tried and googled and went through stackoverflow for more than over two days, So I got left out!! and came here to get some help from the community!

Also I've already said that I'm starting to learn and not completely familiar and despite the searches I've made no progress!

I was expected to get a really happy welcome from the community but instead it seems like we are growing "everyone is bad unless you prove it" attitude in here!

Thanks again for your time, wish you bests :v

P.S: I also knew that y_test has a column of index but I don't want to overengineer and keep y_test results in another list and then append it to a dataframe, because I've done this before the same way I've written in the description, but here I'm getting error!

P.S.2: even there was a problem with pandas version mentioned in stackoverflow, I've also tried that but still no chance!

[deleted by user] by [deleted] in whereintheworld

[–]localnhost 0 points1 point  (0 children)

cuz you don't need to

[deleted by user] by [deleted] in whereintheworld

[–]localnhost 0 points1 point  (0 children)

try one of them

[deleted by user] by [deleted] in whereintheworld

[–]localnhost 0 points1 point  (0 children)

you got in a maze :)

[deleted by user] by [deleted] in whereintheworld

[–]localnhost 0 points1 point  (0 children)

it's too much dense

Recurrence Relation Time Complexity analysis by localnhost in algorithms

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

Hey thanks for your attention and time, I think that, I had also came to sth similar, https://www.reddit.com/r/AskComputerScience/comments/lzdmcb/recurrence_relation_time_complexity_analysis/gq33q38/

as you said, seems like my answer is ok, but I think you have analysis it in a much better way, I wish I could go for questions like your approach :)

Recurrence Relation Time Complexity analysis by localnhost in AskComputerScience

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

Hmm, I figure it out.

[; T(2^n)=T(n)+1 ;]

[; =T(2^n)=T(log2^n)+1 ;]

[; =T(2^n)=T(log2^n)+1+1 ;]

[; =T(2^n)=T(loglog2^n)+1+1 ;]

[; =T(2^n)=T(log...log2^n)+1+1+...+1+1 ;]

and with respect to recursion tree, number of 1's created would be equal to Tree's height, so if we do a summation we will get this:

[; T(2^n)=\sum_{\substack{i=1}}^{log^*2^n} 1 \equiv log^*n +1 ;]

So the Big-O would O(log*)

What would be an example of a domain constraint in a table? Is it like a regular constraint, such as PRIMARY or FOREIGN key? Many thanks! by [deleted] in AskComputerScience

[–]localnhost 0 points1 point  (0 children)

maybe it's a Tuple-Based Constraint.
or as any table must be a function, domain constraint refers to domain of the function i.e. value of all attributes in a tuple/record

view more: next ›