It's difficult to tell what is being asked here. This question is ambiguous, vague, incomplete, overly broad, or rhetorical and cannot be reasonably answered in its current form. For help clarifying this question so that it can be reopened, visit the help center.
Closed 10 years ago.
how to group similar url using the DBSCAN algorithm. I have seen many datasets but none were on url , I want to take similar type of urls and group it together. Here i am not able to know distance (eps) and minpoints can be the number of urls to be grouped.
DBSCAN needs a distance function and a threshold for detecting similar objects.
So go ahead, first you need to define an appropiate distance function and a threshold, then we can help you with DBSCAN (but you should be able to find DBSCAN implementations that can be extened to arbitrary distance functions).
The key challenge is the distance, and this is up to you, because we do not know what you want to get out. This is very subjective, and we just don't know what you want or need.
Related
It's difficult to tell what is being asked here. This question is ambiguous, vague, incomplete, overly broad, or rhetorical and cannot be reasonably answered in its current form. For help clarifying this question so that it can be reopened, visit the help center.
Closed 10 years ago.
I'm trying to figure out an approach to compare two melodies to see how similar they are. Timbre doesn't matter. So if I had two recordings, one of a flute playing Happy Birthday and one of a Trumpet playing the same thing at the same pitches and tempo, it should consider them a match.
Is there a .NET or C++ library that can do this? If not, can someone give me an idea of what techniques I would need to do something like this?
Aubio has a C++ interface and several methods for performing pitch detection.
Since you are assuring that pitch and tempo will be the same and you seem to be ruling out harmonies, you can measure pitch over time and compare the two results.
Your comparison algorithm will require trial-and-error refinement. Keep in mind:
noise, timbre, and volume fluctuations can make the pitch at any moment a subjective topic
real-world performers can have similar pitch and tempo, but it's unlikely that they'll be perfectly the same.
The two songs may not start at the same moment in the recording.
It's difficult to tell what is being asked here. This question is ambiguous, vague, incomplete, overly broad, or rhetorical and cannot be reasonably answered in its current form. For help clarifying this question so that it can be reopened, visit the help center.
Closed 10 years ago.
I want to make a program that gets the information of a family including their names, SSN etc. I'm facing with two problems, firstly, what is the best data structure for this purpose,secondly, how should i get the information from the user, i mean when I'm getting info of father,i should determine his children, here is the problem.
how to connect his children to himself?
If it were me, I'd create a few different parallel arrays.
You're going to need to find out the algorithms for search through the arrays.
You're going to need to find out how to match them up together using the same index once the search finds a match. The index will probably be needed to be returned by reference to make things easier.
How to connect the children to the father maybe harder...
I don't know much about Binary Trees, we never talked about those in class. But that maybe the answer you're looking for. Sorry I couldn't be of more help. It's Christmas and it's 3AM lol. Good luck.
It's difficult to tell what is being asked here. This question is ambiguous, vague, incomplete, overly broad, or rhetorical and cannot be reasonably answered in its current form. For help clarifying this question so that it can be reopened, visit the help center.
Closed 10 years ago.
Without using sequence generator How can we generate sequences in informatica mapping ?
Thanks
Well, like others said, I would have preferred to get a specific question on why you are trying to avoid sequence generator. Having said that, if i open myself to "the idea of an alternate" to sequence generator, some things do come to mind
If you have a relatively simplistic mapping, you can embed a oracle/db sequence.nextval call hidden in the source qualifier.
you can embed db/sequence call in a sql tranformation too. But know that it would be anti-performant.
you will be able to achieve a sequence generator behaviour using a persistent variable too, but there are limitations and downsides.
So, again, depending upon what you are trying to do and where you are getting stuck, you might want to repost/edit your question.. and perhaps get a more direct answer.
It's difficult to tell what is being asked here. This question is ambiguous, vague, incomplete, overly broad, or rhetorical and cannot be reasonably answered in its current form. For help clarifying this question so that it can be reopened, visit the help center.
Closed 12 years ago.
I have ordederd to make a function, which takes a list ex [3,4,6,1,29] and returns a list of tuples [(3,4),(4,6),(6,1),(1,29)]
This is a very easy question, it's really hard to help without defeating the purpose...
If you are allowed to use predifined functions, there is already one which can do almost all work for you (if you don't know which one, try finding it with http://www.haskell.org/hoogle/ ). Take a step back and think about the easier question how to produce a list [(3,3),(4,4),(6,6),(1,1),(29,29)].
If you can't use predefined functions, then recursion is your friend: What do you need to do for an empty list? What for a list with one element? With two elements?
Without any own effort I can't give more hints. If you're stuck, extend your question and show what you already got, and we'll try to help.
It's difficult to tell what is being asked here. This question is ambiguous, vague, incomplete, overly broad, or rhetorical and cannot be reasonably answered in its current form. For help clarifying this question so that it can be reopened, visit the help center.
Closed 12 years ago.
I'm trying to pick out my next hackery project. It'll likely be one of the following:
A sparse radix trie Implementation with extremely fast set operations
A really good soft heap implementation
A bloomier filter implementation
A collection of small financial algorithms, such as deriving total returns given a set of dividends and minimal information about them.
But I can't choose. So I thought I'd put my fate in the hands of my peers. Which of those four would you find most useful? Most interesting to work on? Which do you think is the most needed?
I didn't know what a bloomier (maybe Bloom?) filter is until reading your question. Sounds cool and useful.