Jump to content

User talk:Glokc

Page contents not supported in other languages.
From Wikipedia, the free encyclopedia

Glokc, you are invited to the Teahouse!

[edit]
Teahouse logo

Hi Glokc! Thanks for contributing to Wikipedia.
Be our guest at the Teahouse! The Teahouse is a friendly space where new editors can ask questions about contributing to Wikipedia and get help from experienced editors like Lectonar (talk).

We hope to see you there!

Delivered by HostBot on behalf of the Teahouse hosts

16:06, 1 February 2019 (UTC)

Use talk page for cluster analysis

[edit]

Wikipedia is not a place to promote some research. Please use talk page before posting overhaul and obscure citations. And remember the 3RR rule. Limit-theorem (talk) 12:53, 2 February 2019 (UTC)[reply]

Thanks for starting the discussion here, I was not sure how it's better to contact you. The articles are cites being proofs for the made statements, they belong to different authors and were published in the well known conferences or journals. Therefore, I believe this is the right way to write any proved and trusted statements referring to the peer-reviewed scientific papers.
If you think than any fixed / added / extended statements or citations are wrong / controversial / irrelevant then please let me know what exactly instead of "undo" all my extensions, which I believe make the article more precise and up to date. --Glokc (talk) 17:14, 2 February 2019 (UTC)[reply]
Please, note that I have not deleted any of your or original material of the article, just corrected some statements citing the proofs for the made changes (and merging the original material to the modified version) and extended a lot based on the state-of-the-art research in the field, which is the field of my expertise. --Glokc (talk) 17:24, 2 February 2019 (UTC)[reply]
[edit]

Hello, and welcome to Wikipedia! We welcome and appreciate your contributions, such as Cluster analysis, but we regretfully cannot accept copyrighted text or images from either web sites or printed works. This article appears to contain work copied from https://exascale.info/assets/pdf/icdm18_clubmark.pdf, and therefore to constitute a violation of Wikipedia's copyright policies. The copyrighted text has been or will soon be deleted. While we appreciate contributions, we must require all contributors to understand and comply with our copyright policy. Wikipedia takes copyright violations very seriously, and persistent violators are liable to be blocked from editing.

If you believe that the article is not a copyright violation, or if you have permission from the copyright holder to release the content freely under license allowed by Wikipedia, then you should do one of the following:

It may also be necessary for the text be modified to have an encyclopedic tone and to follow Wikipedia article layout. For more information on Wikipedia's policies, see Wikipedia's policies and guidelines.

See Wikipedia:Declaration of consent for all enquiries for a template of the permissions letter the copyright holder is expected to send.

If you would like to begin working on a new version of the article you may do so at this temporary page. Leave a note at Talk:Cluster analysis saying you have done so and an administrator will move the new article into place once the issue is resolved.

Thank you, and please feel welcome to continue contributing to Wikipedia. Happy editing! HelpUsStopSpam (talk) 01:41, 11 February 2019 (UTC)[reply]

Also, please review the WP:COI policy. HelpUsStopSpam (talk) 01:41, 11 February 2019 (UTC)[reply]

Hello @HelpUsStopSpam:, thank you for the clarification about the copyright issues. Indeed some text was copied from the mentioned paper to the Evaluations section, however the paper was initially issued to the public domain under the Apache 2 license together with the source codes as stated in the Clubmark project repository.
In addition, today the author(s) have emailed the permission to permissions-en(at)wikimedia(dot)org to use the paper under the (CC-BY-SA), version 3.0. --Glokc (talk) 05:23, 11 February 2019 (UTC)[reply]