Main

related bits

0

processing priority

4

site type

3 (personal blog or private political site, e.g. Blogspot, Substack, also small blogs on own domains)

review version

11

html import

20 (imported)

Events

first seen date

2024-11-16 08:19:52

expired found date

-

created at

2024-11-16 08:19:52

updated at

2026-02-03 14:17:08

Domain name statistics

length

30

crc

39459

tld

2211

nm parts

0

nm random digits

0

nm rare letters

0

Connections

is subdomain of id

69893241 (blogspot.com)

previous id

0

replaced with id

0

related id

-

dns primary id

0

dns alternative id

0

lifecycle status

0 (unclassified, or currently active)

Subdomains and pages

deleted subdomains

0

page imported products

0

page imported random

0

page imported parking

0

Error counters

count skipped due to recent timeouts on the same server IP

0

count content received but rejected due to 11-799

0

count dns errors

0

count cert errors

0

count timeouts

0

count http 429

0

count http 404

0

count http 403

0

count http 5xx

0

next operation date

-

Server

server bits

server ip

-

Mainpage statistics

mp import status

20

mp rejected date

-

mp saved date

-

mp size orig

190841

mp size raw text

37162

mp inner links count

50

mp inner links status

20 (imported)

Open Graph

title

Text & Data Mining by practical means

description

Text mining, data mining, predictive analytics: A space to exchange ideas that work in enterprise contexts.

image

site name

author

updated

2026-02-02 00:08:38

raw text

Text & Data Mining by practical means Text & Data Mining by practical means Text mining, data mining, predictive analytics: A space to exchange ideas that work in enterprise contexts. Pages Home About Cristian Donations Status Tuesday, December 9, 2014 Partitional clustering: number of clusters and performances a quantitative analysis Abstract Partitional clustering methods as k-medoid or k-means require an input parameter to specify the number of clusters to partition the data. The complexity in time of such algorithms strictly depends on the number of clusters used to initialise the computation. the steps to update the centroids. Whenever the similarity distance doesn't allow the determination of the centroid thru the analytical methods, the complexity in time tends to explode. In the post I show an heuristic to minimise the complexity in time in non-Euclidean space. Number of computational steps for standard k-mean executed. Chart depicts  the steps b...

Text analysis

redirect type

0 (-)

block type

0 (no issues)

detected language

1 (English)

category id

Other [en] (231)

index version

2025123101

spam phrases

1

Text statistics

text nonlatin

0

text cyrillic

0

text characters

27992

text words

6254

text unique words

1217

text lines

582

text sentences

263

text paragraphs

113

text words per sentence

23

text matched phrases

2

text matched dictionaries

5

RSS

rss status

32 (unknown)

rss found date

2024-11-16 08:19:53

rss size orig

313617

rss items

25

rss spam phrases

1

rss detected language

1 (English)

inbefore feed id

-

inbefore status

0 (new)

Sitemap

sitemap status

40 (completed successful import of reports.txt file to table in_pages)

sitemap review version

2

sitemap urls count

51

sitemap urls adult

0

sitemap filtered products

1

sitemap filtered videos

0

sitemap found date

2024-11-16 08:19:53

sitemap process date

2025-03-26 17:38:13

sitemap first import date

-

sitemap last import date

2025-10-09 07:03:54