I am a relative neophyte but I do have a vision.It is of a grand, worldwide system that connects all of the main data of all countries.One stop shopping.But because it is so vast, it also contains software that, with a few clicks, you can see a schematic map of where you have visited (e.g. Demark, Torslev parish registers, 1868-1882, record 9-13-22-68) and with another click the search terms you used (e.g. Niels, Niels Peter, Christian, Niels Christian).The problem is that it all becomes a big blurr after a while and you start searching at random wasting you time in places you've already exhausted.
Another nice bit would be if the software was able to tell when you land on the very best match in the megasystem, even if it is not an exact match, and automatically inserts the information in your family tree.
I have developed several personal guidelines for ignoring sites I don't want. I tell it to ignore these sites, but they keep coming back. What is the sense of having the ignore function if it isn't permanent?
Probably the managers are spawning of new trees by Save as for some reason. I have one manager that I counted up to 75 different trees with new dates all the time. Now I have not seen any new trees lately so something has happened. If MH has informed him/her or the manager have finaly stopped spawning of new trees or not used MH lately, I dont know.
One of my criteria is the age of the "tree" with the smart match. I believe many people start a tree then quit. If the tree isn't maintained, it probably isn't very valuable. The manager was probably not that interested in accuracy, either. Good or bad, that's my criteria.
Many sites had their last update 5 or more years ago. I tell the program to ignore and it still comes back. Another criteria is that many sites display almost nothing but "private" for their data. I'm not particularly interested in wasting time on those sites, either. I don't think the dates of a tree should override my decision on whether to take time with a sites S's
IF and I say IF the tree data was accurate then sure maintain the tree and all is good.
I think the user was trying to say that if a discrepencyis discovered, and the user is "gone into the cyberspace" the data is NOT good and the tree is INVALID or at least has elemnts that should be changed.
There is a vast difference between an accurate tree and having THAT data available as opposed to a tree with errors that just get perpetuated and APPEAR to be vindicated just becuse many users have adopted the tree.
Ron, you said, 'I think the user was trying to say that if a discrepancy is discovered, and the user is "gone into the cyberspace" the data is NOT good and the tree is INVALID or at least has elements that should be changed.'
I agree, and that is why I suggested to MH that they allow comments to be 'stuck onto' trees by other members.
I'm not sure if I read your post correctly (I'm from Sweden). If there are discrepencis between an old tree and a new one, what says that the error is in the old tree? I have many cases where I find new errors in trees compared with my data which I entered long time ago and I know that there are no new research data. What I do know is that there are some old research litterature scaned, where new research has proved it wrong, which many people use since they only want to access free books and dont want to spend money on the new research litterature. How do I know that the data is resently entered in the tree? The manager became member of MH after I entered my data.
Also there is new litterature that rest on old research where there now are new findings, so you really need to check out the sources. This was highlighted in a swedish genealogy forum where someone refered to a resently published book and a researcher pointed out that that book rested on old research.
Why is an old tree not updated? Maybe because it is fully researsched and without faults.
"I contend that if a tree is published and subsequent to that publishing date the user ceases to be financial, thus CANNOT be contacted for "discussion and or (deiting) (amendment of data??)" then that tree is not valid.
MY have the view that it WAS valid and the data does not change simply because the user is non financial."
I must categorically agree with My Heritage.
But I have suggested to them (and at least they said it is a good idea) that other MH members may be able to leave a "COMMENT" in a tree.
Another well-known genealogy program allows this, with a big green pencil icon and the name of the member inserting the comment.
The issue I raised was not whethr the tree was or was not "valid". It is an issue of having to spend hours or days going thru 5,000 smart matches that have varying degrees of validity to me. Especially the sites where all (most) of the data is <private>. The program says I can mark a site to ignore, now and future, smart matches from a site, and can reset the ignore if I chose.
If a site is updated for deaths and births, the date is updated. This makes my point!!! Ignores could be permanent unless rreset by the user, and a reset could be dependent on how old the data is. I should be able to make my own decisions on how to expedite the construction of my site!!!
My tree has about 10000 people in it. It takes about 1 month to finish the Smart Matching. During this time I get smart matches but that may come from older parts of the tree already known by the system.
Its OK. As long as you dont call me Bo. As I mentioned in an other post in another thread, my name is Bo Anders but is called Anders and when sellers wants to be personal they look at my name and call me Bo which I hate.
MH said once that my tree of 10000 was big. I have noticed that at the beginning of the matching not much happens with my additions and if your tree is large it will probably take a while before anything starts to happen.
I am trying to ignore certain smart matches, and I keep getting the message that I have to have the Premium Version to confirm or ignore the smart match. So, I guess that this is one of the ways that MyHeritage makes people buy the Premium Version?