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 11 years ago.
I have a big database of jobs, each job has numerical and non numerical attributes like(position,field,salary, needed experience...)
and applicants to jobs that determine some attributes like(age, expected salary...)
I want to create an application that do automatic matching between the jobs and the appropriate candidates*What is the best Algorithm to apply (data mining or artificial intelligence) to implement this app.*
thx for your replies
It seems that what you want is a recommendation algorithm, not matching algorithm.
There is not best recommendation algorithm which work for all cases. You should look into several algorihms and select which suits best for your situation. I recommend you to look at Apache Mahout which implements lots of such recommendation algorithms and is an open-source library.
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 11 years ago.
My multicore machine is receiving packets and distributes them evenly (sort-of round robin) among its cores. Each core should decide whether to let the packet pass or drop it, depending solely on its origin address.
I need to find lock-less algorithm and data structure to allow this. Can you help?
If you are happy to use Java, or look at the design of Java source, you could chose a random key and then retrieve a queue from http://docs.oracle.com/javase/1.5.0/docs/api/java/util/concurrent/ConcurrentHashMap.html. Given the queue, you could add the packet to it without blocking if it was a http://docs.oracle.com/javase/1.5.0/docs/api/java/util/concurrent/ConcurrentLinkedQueue.html
Much of java.util.concurrent is due to Doug Lea, who has information on it at http://gee.cs.oswego.edu/dl/concurrency-interest/index.html.
Possibly overkill for your particular problem, but might satisfy a general request for info on data structures in this area.
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 11 years ago.
Assume:
There are hundred students and each on
of them are working on a common
project.
Ideally, being consistent implies that a student works everyday on the project at-least once.
If we have data like this:
Student 1 work day 1(worked)
day 2(worked)
day 3(took a break)
etc
Now is there any algorithm that can be used to check and rank students based on consistency ?
EDIT:
This is not a homework problem. I am developing a plugin in java that rates group work according to consistency. So I was wondering if there was an algorithm that can accurately predict consistency. I was thinking about using standard deviation but if there is something more precise, it would help.
I believe the quantity you are looking for is called variance. This describes consistency, if you were to say, use the time each day that a student works.
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 11 years ago.
I want to know if is there any specific algorithm that can be followed to understand the meaning of a word/sentence/paragraph. Basically, I want to write a program that will take text/paragraph as input and try to find out what its meaning is. And thereby highlight the emotions within the text.
Also, if there is an algorithm to understand things, can the same algorithm be applied to itself? It reduces the quest further to a point where we become interested in knowing meaning of meaning OR rather definition of definition.
You want Natural Language Processing and Semantic Technology. This is still a flourishing area in computer science. Look at things such as a Semantic Reasoner. You can start with Jena. There are also other things you can look at such as Academic Thesis papers.
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 11 years ago.
i never work with DLINQ so i dont know the use of DLINQ. so can anyone show the situation where DLINQ is required and also show me the various use of DLINQ.
"While writing type-safe queries is great for most scenarios, there are cases where you want the flexibility to dynamically construct queries on the fly. For example: you might want to provide business intelligence UI within your application that allows an end-user business analyst to use drop-downs to build and express their own custom queries/views on top of data. "
from: this article
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 13 years ago.
What are the main algorithms used in RDMBS ?
The most common is
B-Tree
http://en.wikipedia.org/wiki/B-tree
A very complex topic. B-tree is just one of the algorithms; it is a binary algorithm used to find records quickly.
Here are some others:
http://en.wikipedia.org/wiki/Category:Database_algorithms
SQLite is a good database to study because the code base is very small and much easier to understand than the bigger ones.